Related papers: A Closer Look at Chapoton's q-Ehrhart Polynomials
The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and…
We prove the central limit theorem for the volume and the $f$-vector of the Poisson random polytope $\Pi_{\eta}$ in a fixed convex polytope $P\subset\mathbb{R}^d$. Here, $\Pi_{\eta}$ is the convex hull of the intersection of a Poisson…
We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.
The number of solutions in finite fields of a system of polynomial equations obeys a very strong regularity, reflected for example by the rationality of the zeta function of an algebraic variety defined over a finite field, or the…
Given an integral polyhedron P and a rational polyhedron Q living in the same n-dimensional space and containing the same integer points as P, we investigate how many iterations of the Chv\'atal-Gomory closure operator have to be performed…
For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…
We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…
Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…
Let $\mathfrak{p} \subset V$ be a polytope and $\xi \in V_{\mathbb{C}}^*$. We obtain an expression for $I(\mathfrak{p}; \alpha) := \int_{\mathfrak{p}} e^{\langle \alpha, x \rangle} dx$ as a sum of meromorphic functions in $\alpha \in…
The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…
We discover that tautological intersection numbers on $\bar{\mathcal{M}}_{g, n}$, the moduli space of stable genus $g$ curves with $n$ marked points, are evaluations of Ehrhart polynomials of partial polytopal complexes. In order to prove…
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…
We study higher-dimensional analogs of the Dedekind-Carlitz polynomials c(u,v;a,b) := sum_{k=1..b-1} u^[ka/b] v^(k-1), where u and v are indeterminates and a and b are positive integers. Carlitz proved that these polynomials satisfy the…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…
We consider the Ehrhart polynomial of hypersimplices. It is proved that these polynomials have positive coefficients and we give a combinatorial formula for each of them. This settles a problem posed by Stanley and also proves that uniform…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…