English
Related papers

Related papers: Perfect matroids over hyperfields

200 papers

Hyperstructures are a natural extension of regular algebraic structures in which one of the operations, known as the hyperoperation, is multivalued; a hyperfield is such an extension on a field. M. Krasner (1962) proved that the quotient…

Rings and Algebras · Mathematics 2019-01-31 Antonio Frigo , Hahn Lheem , Dylan Liu

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

We enrich Baker and Bowler's theory of matroids over tracts with notions of vectors and covectors. In the case of oriented matroids, these $F$-vectors and $F$-covectors coincide with the usual signed vectors and signed covectors. In the…

Combinatorics · Mathematics 2018-07-24 Laura Anderson

We investigate the strong Rayleigh property of matroids for which the basis enumerating polynomial is invariant under a Young subgroup of the symmetric group on the ground set. In general, the Grace-Walsh-Szeg\H{o} theorem can be used to…

Combinatorics · Mathematics 2014-12-01 Wenbo Gao , David G. Wagner

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

We give two proofs that the $h$-vector of any paving matroid is a pure O-sequence, thus answering in the affirmative a conjecture made by R. Stanley, for this particular class of matroids. We also investigate the problem of obtaining good…

Combinatorics · Mathematics 2010-08-17 Criel Merino , Steven D. Noble , Marcelino Ramírez-Ibañez , Rafael Villarroel

The main purpose of the paper is to establish a closedness theorem over Henselian valued fields $K$ of equicharacteristic zero (not necessarily algebraically closed) with separated analytic structure. It says that every projection with a…

Algebraic Geometry · Mathematics 2018-01-09 Krzysztof Jan Nowak

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

Hyperfields and systems are two algebraic frameworks which have been developed to provide a unified approach to classical and tropical structures. All hyperfields, and more generally hyperrings, can be represented by systems. Conversely, we…

Rings and Algebras · Mathematics 2023-04-28 Marianne Akian , Stephane Gaubert , Louis Rowen

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…

Combinatorics · Mathematics 2026-03-11 Jannis Koulman , Oliver Lorscheid

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…

Combinatorics · Mathematics 2022-11-16 Luis Ferroni , George D. Nasr , Lorenzo Vecchi

We develop a theory of extensions of hyperfields that generalizes the notion of field extensions. Since hyperfields have a multivalued addition, we must consider two kinds of extensions that we call weak hyperfield extensions and strong…

Rings and Algebras · Mathematics 2019-12-13 Steven Creech

In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. Firstly, a vector matroid is defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived in terms…

Systems and Control · Computer Science 2017-04-04 Yupeng Yuan , Zhixiong Li , Malekian Reza , Yongzhi Chen , Ying Chen

We extend the characterization of extremal valued fields given in \cite{[AKP]} to the missing case of valued fields of mixed characteristic with perfect residue field. This leads to a complete characterization of the tame valued fields that…

Logic · Mathematics 2016-07-12 Sylvy Anscombe , Franz-Viktor Kuhlmann

We study model theoretic properties of valued fields (equipped with a real-valued multiplicative valuation), viewed as metric structures in continuous first order logic. For technical reasons we prefer to consider not the valued field…

Logic · Mathematics 2013-05-08 Itaï Ben Yaacov

Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…

Combinatorics · Mathematics 2024-08-02 Huy Truong , Pietro Poggi-Corradini