Related papers: Thin polytopes: Lattice polytopes with vanishing l…

Lattice polytopes are called IDP polytopes if they have the integer decomposition property, i.e., any lattice point in a $k$th dilation is a sum of $k$ lattice points in the polytope. It is a long-standing conjecture whether the numerator…

Over a decade ago De Loera, Haws and K\"oppe conjectured that Ehrhart polynomials of matroid polytopes have only positive coefficients and that the coefficients of the corresponding $h^*$-polynomials form a unimodal sequence. The first of…

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…

This article provides a comprehensive exposition about inequalities that the coefficients of Ehrhart polynomials and $h^*$-polynomials satisfy under various assumptions. We pay particular attention to the properties of Ehrhart positivity as…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…

A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…

We study the Ehrhart $h^\ast$-polynomial of (the boundary of) a lattice polytope via regular unimodular triangulations and Gr\"obner degenerations of toric ideals. Our main result is a boundary analogue of the well-known Sturmfels…

We show that when integral polytopes are deformed while keeping the same facet normal vectors, the coefficients of weighted Ehrhart and $h^*$-polynomials are piecewise polynomial functions in the ``right hand sides'' of the linear…

In this paper, we characterize the vanishing of twisted central $L$-values attached to newforms of square-free level in terms of so-called local polynomials and the action of finitely many Hecke operators thereon. Such polynomials are the…

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…

In this paper, we study nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give…

For a given lattice polytope, two fundamental problems within the field of Ehrhart theory are to (1) determine if its (Ehrhart) $h^\ast$-polynomial is unimodal and (2) to determine if its Ehrhart polynomial has only positive coefficients.…

We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…

We study the extended root polytope associated to a directed graph. We show that under the operations of deletion and contraction of an edge of the graph, none of the coefficients of the $h^*$-polynomial of the associated extended root…