English
Related papers

Related papers: Matroids are not Ehrhart positive

200 papers

Motivated by the notion of the inverse $Z$-polynomial introduced by Ferroni, Matherne, Stevens, and Vecchi, we study the equivariant inverse $Z$-polynomial of a matroid equipped with a finite group. We prove that the coefficients of the…

Combinatorics · Mathematics 2026-01-27 Alice L. L. Gao , Yun Li , Matthew H. Y. Xie

It is already known that order polytopes and chain polytopes are always 2-level polytopes. In general, this is not true for marked order and marked chain polytopes. We study the geometry of marked order polytopes, marked chain polytopes,…

Combinatorics · Mathematics 2025-03-26 Jan Stricker

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 investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…

Metric Geometry · Mathematics 2011-10-20 Martin Henk , Achill Schuermann , Joerg M. Wills

The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…

Combinatorics · Mathematics 2019-03-04 Carolyn Chun , Iain Moffatt , Steven D. Noble , Ralf Rueckriemen

We study the way in which equivariant Kazhdan-Lusztig polynomials, equivariant inverse Kazhdan-Lusztig polynomials, and equivariant Z-polynomials of matroids change under the operation of relaxation of a collection of stressed hyperplanes.…

Combinatorics · Mathematics 2022-02-15 Trevor Karn , George Nasr , Nicholas Proudfoot , Lorenzo Vecchi

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

We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…

Combinatorics · Mathematics 2020-11-13 Peter Nelson , Sergey Norin

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…

Combinatorics · Mathematics 2019-10-03 Laszlo Csirmaz

In 1993, Csima and Sawyer proved that in a non-pencil arrangement of n pseudolines, there are at least $\frac{6}{13}n$ simple points of intersection. Since pseudoline arrangements are the topological representations of reorientation classes…

Combinatorics · Mathematics 2021-02-01 Lamar Chidiac , Winfried Hochstättler

We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground…

Combinatorics · Mathematics 2013-09-17 Federico Ardila , Felipe Rincón , Lauren Williams

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

We focus on checking the validity of the half-plane property on two prominent classes of transversal matroids, namely lattice path matroids and bicircular matroids. We show that lattice path matroids satisfy the half-plane property.…

Combinatorics · Mathematics 2024-02-12 Ayush Kumar Tewari

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

Hibi showed that the polynomial in the numerator of the Ehrhart series of a reflexive polytope is palindromic. We proved that those in the numerator of the Ehrhart series of every graph polytope (defined later) of the bipartite graph is…

Combinatorics · Mathematics 2015-07-24 Daeseok Lee , Hyeong-Kwan Ju

We use the equivariant cohomology ring of the permutohedral variety to study matroids and their invariants. Investigating the pushforward of matroid Chern classes defined by A. Berget, C. Eur, H. Spink and D. Tseng to the product space…

Algebraic Geometry · Mathematics 2025-09-25 Mario Bauer , Matěj Doležálek , Magdaléna Mišinová , Semen Słobodianiuk , Julian Weigert

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Jim Geelen , Peter Nelson

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

In this paper, we provide a simple criterion for the Schubitope $\mathcal{S}_{D}$ associated to a diagram $D$ to be lattice-free. We further show that $\mathcal{S}_{D}$ is lattice-free if and only if its Ehrhart polynomial is equal to the…

Combinatorics · Mathematics 2026-05-12 Jinren Dou , Neil J. Y. Fan , Kunwen Liu

Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Kevin Long