English
Related papers

Related papers: Infinite matroids in tropical differential algebra

200 papers

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

Let $M$ be a matroid on a set $E$ and let $w:E\longrightarrow G$ be a weight function, where $G$ is a cyclic group. Assuming that $w(E)$ satisfies the Pollard's Condition (i.e. Every non-zero element of $w(E)-w(E)$ generates $G$), we obtain…

Combinatorics · Mathematics 2009-03-05 Y. O. Hamidoune , I. P. da Silva

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge Luis Ramírez Alfonsín

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

Given an assignment of real weights to the ground elements of a matroid, the min-max weight of a ground element $e$ is the minimum, over all circuits containing $e$, of the maximum weight of an element in that circuit with the element $e$…

Computational Complexity · Computer Science 2020-09-17 Stasys Jukna , Hannes Seiwert

We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…

Combinatorics · Mathematics 2026-03-20 Kyle Binder

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

Combinatorics · Mathematics 2026-05-26 Juliette Bruce , Jacob Bucciarelli , Bailee Zacovic

The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…

Statistics Theory · Mathematics 2011-09-19 Johannes Rauh , Thomas Kahle , Nihat Ay

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

The cogirth, $g^\ast(M)$, of a matroid $M$ is the size of a smallest cocircuit of $M$. Finding the cogirth of a graphic matroid can be done in polynomial time, but Vardy showed in 1997 that it is NP-hard to find the cogirth of a binary…

Combinatorics · Mathematics 2021-06-03 Cameron Crenshaw , James Oxley

In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…

Combinatorics · Mathematics 2019-06-13 Patrick Tam

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

Combinatorics · Mathematics 2025-09-17 Nathan Bowler , Attila Joó

Tropical Differential Algebraic Geometry considers difficult or even intractable problems in Differential Equations and tries to extract information on their solutions from a restricted structure of the input. The Fundamental Theorem of…

We prove that the number of tropical critical points of an affine matroid (M,e) is equal to the beta invariant of M. Motivated by the computation of maximum likelihood degrees, this number is defined to be the degree of the intersection of…

Combinatorics · Mathematics 2024-07-23 Federico Ardila-Mantilla , Christopher Eur , Raul Penaguiao

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…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa