English
Related papers

Related papers: On simple matroids with a unique minimal tropical …

200 papers

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

The basis exchange axiom has been a driving force in the development of matroid theory. However, the axiom gives only a local characterization of the relation of bases, which is a major stumbling block to further progress, and providing a…

Combinatorics · Mathematics 2022-11-23 Kristóf Bérczi , Tamás Schwarcz

We show that for any regular matroid on $m$ elements and any $\alpha \geq 1$, the number of $\alpha$-minimum circuits, or circuits whose size is at most an $\alpha$-multiple of the minimum size of a circuit in the matroid is bounded by…

Data Structures and Algorithms · Computer Science 2018-11-21 Rohit Gurjar , Nisheeth K. Vishnoi

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

Combinatorics · Mathematics 2025-02-04 Emiliano Liwski , Fatemeh Mohammadi

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…

Combinatorics · Mathematics 2012-03-26 Kenji Kashiwabara

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…

Representation Theory · Mathematics 2018-10-23 Noah Giansiracusa , Jacob Manaker

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Combinatorics · Mathematics 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…

Optimization and Control · Mathematics 2017-12-05 Georg Loho

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…

Artificial Intelligence · Computer Science 2012-12-03 Yanfang Liu , William Zhu

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

This paper proves the $4 \times 4$ minors of a $5 \times 5$ symmetric matrix of indeterminates are a tropical basis.

Combinatorics · Mathematics 2022-01-05 Dylan Zwick

In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…

Combinatorics · Mathematics 2019-06-27 Ragnar Freij-Hollanti , Matthias Grezet , Camilla Hollanti , Thomas Westerbäck

We study a notion of tropical linear series on metric graphs that combines two essential properties of tropicalizations of linear series on algebraic curves: the Baker-Norine rank and the independence rank. Our main results relate the local…

Algebraic Geometry · Mathematics 2025-09-05 Chih-Wei Chang , Matthew Dupraz , Hernan Iriarte , David Jensen , Dagan Karp , Sam Payne , Jidong Wang

Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…

Combinatorics · Mathematics 2015-03-13 Alexander Engstrom

We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…

Data Structures and Algorithms · Computer Science 2016-07-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded minor…

Combinatorics · Mathematics 2017-05-26 Carolyn Chun , Rhiannon Hall , Criel Merino , Iain Moffatt , Steven Noble

In this article we study the tropicalization of the Hilbert scheme and its suitability as a parameter space for tropical varieties. We prove that the points of the tropicalization of the Hilbert scheme have a tropical variety naturally…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini , Michele Nesci

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

Combinatorics · Mathematics 2020-07-20 Roberto Pagaria

Let $M$ to be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. In this paper, we prove that the nontrivial facets…

Computational Complexity · Computer Science 2017-02-24 Brahim Chaourar