English
Related papers

Related papers: On the Ehrhart Polynomial of Minimal Matroids

200 papers

There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…

Combinatorics · Mathematics 2020-01-14 Liam Solus

A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…

Combinatorics · Mathematics 2019-10-25 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

Graded Ehrhart theory is a new $q$-analogue of Ehrhart theory based on the orbit harmonics method. We study the graded Ehrhart theory of unimodular zonotopes from a matroid-theoretic perspective. Generalizing a result of Stanley (1991), we…

Combinatorics · Mathematics 2026-03-10 Colin Crowley , Ethan Partida

We prove two recent conjectures of Bourn and Erickson (2023) regarding the real-rootedness of a certain family of polynomials $N_n(t)$ as well as the sum of their coefficients. These polynomials arise as the numerators of generating…

Combinatorics · Mathematics 2024-07-09 Ming-Jian Ding , Jiang Zeng

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

Combinatorics · Mathematics 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

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

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

Combinatorics · Mathematics 2012-10-17 Jim Geelen , Peter Nelson

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

Combinatorics · Mathematics 2025-12-05 Emiliano Liwski , Fatemeh Mohammadi , Rémi Prébet

In Ehrhart theory, the $h^*$-vector of a rational polytope often provide insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic…

Combinatorics · Mathematics 2015-04-28 Robert Davis

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

Combinatorics · Mathematics 2023-01-10 Tianyu Liu

We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…

Algebraic Geometry · Mathematics 2026-03-24 Emiliano Liwski , Fatemeh Mohammadi

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

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

Combinatorics · Mathematics 2026-03-11 Koji Imamura , Keisuke Shiromoto

We use counting arguments to show that asymptotically almost all sparse paving matroids contain an $H$-minor, where $H$ falls into one of several simple classes of matroids. Furthermore the result holds for all $H$ in a larger class of…

Combinatorics · Mathematics 2016-05-10 Will Critchlow

We study algebraic properties of the Tutte polynomial of a matroid and its generalizations to other combinatorially defined bivariate polynomial invariants. Merino, de Mier and Noy showed that the Tutte polynomial of a connected matroid is…

Combinatorics · Mathematics 2025-10-08 Andrew Goodall , Florent Jouve , Jean-Sébastien Sereni

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

Combinatorics · Mathematics 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

We prove that a finite graded simplicial poset with a top element added has real-rooted Chow and augmented Chow polynomials whenever it has a positive $h$-vector. This class of posets include Cohen-Macaulay simplicial posets and in…

Combinatorics · Mathematics 2025-08-22 Elena Hoster , Christian Stump

We prove that for each prime power $q$ there is an integer $n$ such that if $M$ is a $3$-connected, representable matroid with a PG$(n-1,q)$-minor and no $U_{2,q^2+1}$-minor, then $M$ is representable over GF$(q)$. We also show that for…

Combinatorics · Mathematics 2015-03-31 Jim Geelen , Rohan Kapadia

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Combinatorics · Mathematics 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan