Related papers: Matroid Products in Tropical Geometry
We define an intersection product of tropical cycles on matroid varieties (via cutting out the diagonal) and show that it is well-behaved. In particular, this enables us to intersect cycles on moduli spaces of tropical rational marked…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…
We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…
There is a well known correspondence between the triangle inequality for a distance function on a finite set, and idempotency of an associated matrix over the tropical semiring. Recent research has shed new light on the structure…
Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure…
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…
Motivated by recently discovered connections between matroid depth measures and block-structured integer programming [ICALP 2020, 2022], we undertake a systematic study of recursive depth parameters for matrices and matroids, aiming to…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…
A tract $F$ is an algebraic structure where multiplication is defined but addition is only partially defined. They were introduced by Baker and Bowler as a unified framework to study generalisations of matroids, including oriented and…
In this paper we address two of the major foundational questions in the theory of matroids over rings. First, we provide a cryptomorphic axiomatisation, by introducing an analogue of the base polytope for matroids. Second, we describe a…
We introduce a construction of oriented matroids from a triangulation of a product of two simplices. For this, we use the structure of such a triangulation in terms of polyhedral matching fields. The oriented matroid is composed of…
We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…
Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…
In 1980, White conjectured that the toric ideal associated to a matroid is generated by binomials corresponding to a symmetric exchange. In this paper, we prove that classes of matroids for which the toric ideal is generated by quadrics and…
We introduce a notion of Lorentzian proper position in close analogy to proper position of stable polynomials. Using this notion, we give a new characterization of elementary quotients of M-convex function that parallels the Lorentzian…