相关论文: On the Ehrhart Polynomial of Schubert Matroids
We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…
The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart…
Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…
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…
It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\lim_{n\rightarrow\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and…
Demazure characters, also known as key polynomials, generalize the classical Schur polynomials. In particular, when all variables are set equal to $1$, these polynomials count the number of integer points in a certain class of…
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…
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…
Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…
We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
By the work of Ferroni and Larson, Kazhdan-Lusztig polynomials and Z-polynomials of complete graphs have combinatorial interpretations in terms of quasi series-parallel matroids. We provide explicit formulas for the number of…
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
We study equivariant Kazhdan--Lusztig (KL) and $Z$-polynomials of matroids. We formulate an equivariant generalization of a result by Braden and Vysogorets that relates the equivariant KL and $Z$-polynomials of a matroid with those of a…
In her paper "Generalized matroids and supermodular colourings", Tardos studied special delta-matroids obtained from sequences of Higgs lifts; these are the full Higgs lift delta-matroids that we treat and around which all of our results…
This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…
Schubert varieties of hyperplane arrangements, also known as matroid Schubert varieties, play an essential role in the proof of the Dowling-Wilson conjecture and in Kazhdan-Lusztig theory for matroids. We study these varieties as…
Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…
If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…