English
Related papers

Related papers: Infinite matroids in tropical differential algebra

200 papers

We explore several facets of tropical subrepresentations of a linear representation of a group over the tropical semifield $\mathbb{T}$. A key role in the study of tropical subrepresentations is played by two types of modules over a…

Representation Theory · Mathematics 2024-12-02 Jaiung Jun , Kalina Mincheva , Jeffrey Tolliver

Let K be a field, let R=K[x_1,..., x_m] be a polynomial ring with the standard Z^m-grading (multigrading), let L be a Noetherian multigraded R-module, and let F: E --> G be a finite free multigraded presentation of L over R. Given a choice…

Commutative Algebra · Mathematics 2007-05-23 Alexandre Tchernev

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

Flag matroids are combinatorial abstractions of flags of linear subspaces, just as matroids are of linear subspaces. We introduce the flag Dressian as a tropical analogue of the partial flag variety, and prove a correspondence between: (a)…

Combinatorics · Mathematics 2021-03-08 Madeline Brandt , Christopher Eur , Leon Zhang

We prove that the cohomology class of any curve on a very general principally polarized abelian variety of dimension at least 4 is an even multiple of the minimal class. The same holds for the intermediate Jacobian of a very general cubic…

Algebraic Geometry · Mathematics 2026-03-31 Philip Engel , Olivier de Gaay Fortman , Stefan Schreieder

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

A tropical curve \Gamma is a metric graph with possibly unbounded edges, and tropical rational functions are continuous piecewise linear functions with integer slopes. We define the complete linear system |D| of a divisor D on a tropical…

Algebraic Geometry · Mathematics 2016-08-22 Christian Haase , Gregg Musiker , Josephine Yu

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…

Combinatorics · Mathematics 2024-10-22 Usman Ali , Iffat Fida Hussain

The Tic-Tac-Toe matroid is a paving matroid of rank $5$ on 9 elements which is pseudomodular and whose dual is non-algebraic. It has been proposed as a possible example of an algebraic matroid whose dual is not algebraic. We present an…

Combinatorics · Mathematics 2025-11-14 Winfried Hochstättler

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover,…

Algebraic Geometry · Mathematics 2026-05-11 Elisenda Feliu , Paul Alexander Helminck , Oskar Henriksson , Yue Ren , Benjamin Schröter , Máté L. Telek

We study tropical subrepresentations of the Boolean regular representation $\mathbb{B}[G]$ of a finite group $G$. These are equivalent to the matroids on ground set $G$ for which left-multiplication by each element of $G$ is a matroid…

Combinatorics · Mathematics 2025-02-14 Jaiung Jun , Kalina Mincheva , Jeffrey Tolliver

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

Combinatorics · Mathematics 2024-07-31 Matthew Baker , Oliver Lorscheid , Tianyi Zhang

We introduce the matroid-minor coalgebra C, which has labeled matroids as distinguished basis, and coproduct given by splitting a matroid into a submatroid and complementary contraction all possible ways. We introduce two new bases for C;…

Combinatorics · Mathematics 2007-05-23 Henry Crapo , William Schmitt

Tropical ideals are a class of ideals in the tropical polynomial semiring that combinatorially abstracts the possible collections of supports of all polynomials in an ideal over a field. We study zero-dimensional tropical ideals I with…

Combinatorics · Mathematics 2021-02-23 Nicholas Anderson , Felipe Rincón

Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…

Algebraic Geometry · Mathematics 2018-06-18 Dustin Cartwright

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…

Combinatorics · Mathematics 2018-08-01 Peter Nelson , Kazuhiro Nomoto