Related papers: Notes on the roots of Ehrhart polynomials

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…

The $n$-dimensional lattice polytopes $\mathcal{Q}_{n,k}$ obtained by intersecting the $n$th dilate of the standard $n$-dimensional simplex in $\mathbb{R}^n$ with the half-spaces $x_i \le 1$ for $1 \le i \le k$ form an interesting special…

We study the roots of the generalised Hermite polynomials $H_{m,n}$ when both $m$ and $n$ are large. We prove that the roots, when appropriately rescaled, densely fill a bounded quadrilateral region, called the elliptic region, and organise…

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

The Ehrhart polynomial $\text{ehr}_P(n)$ of a lattice polytope $P$ counts the number of integer points in the $n$-th integral dilate of $P$. The $f^*$-vector of $P$, introduced by Felix Breuer in 2012, is the vector of coefficients of…

Let n >= 2 be an integer and consider the set T_n of n by n permutation matrices pi for which pi_{ij}=0 for j>=i+2. In this paper we study the convex hull of T_n, which we denote by P_n. P_n is a polytope of dimension binom{n}{2}. Our main…

The magic positivity of Ehrhart polynomials is a useful tool for proving the real-rootedness of the $h^\ast$-polynomials. In this paper, we provide a new class of reflexive polytopes whose Ehrhart polynomials are magic positive. First, we…

The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

For every integer $n$ with $n \geq 4$, we prove that the local dimension of a poset consisting of all the subsets of $\{1,\dots,n\}$ equipped with the inclusion relation is strictly less than $n$, answering a question of Kim, Martin,…

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in $\mathbb{R}^6$ is NP-hard. We apply this result to show that given a rational convex polytope $P \subset…

We prove upper and lower bounds on the local dimension of any pair of layers of the Boolean lattice, and show that the local dimension of the first and middle layers of the $n$-dimensional Boolean lattice is asymptotically $\frac{n}{\log_2…

The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associated to the root lattices A_n, C_n, and D_n, and compute their…

The collection of all $n$-point metric spaces of diameter $\le 1$ constitutes a polytope $\mathcal{M}_n \subset \mathbb{R}^{\binom{n}{2}}$, called the \emph{Metric Polytope}. In this paper, we consider the best approximations of…

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

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…

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…