Related papers: Thin Simplices via Modular Arithmetic

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

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…

For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…

Hibi, Yoshida, and the author classified Gorenstein simplices which are not lattice pyramids and whose \(h^*\)-polynomials are of the form \(1+t^k+t^{2k}+\cdots+t^{(v-1)k}\) when \(v\) is a prime number or the product of two prime numbers.…

An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider…

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…

Orthogonal polynomials for the multivariate hypergeometric distribution are defined on lattices in polyhedral domains in $\RR^d$. Their structures are studied through a detailed analysis of classical Hahn polynomials with negative integer…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…

Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

In this article Ehrhart quasi-polynomials of simplices are employed to determine isospectral lens spaces in terms of a finite set of numbers. Using the natural lattice associated with a lens space the associated toric variety of a lens…

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…

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…

We formulate conjectures giving combinatorial interpretations of the Ehrhart $h^*$-vector, for hypersimplices, for dilated simplices and for generic cross-sections of cubes, in terms of certain decorated ordered set partitions. All were…

A lattice polytope $\mathcal{P} \subset \mathbb{R}^d$ is called a locally anti-blocking polytope if for any closed orthant $\mathbb{R}^d_{\varepsilon}$ in $\mathbb{R}^d$, $\mathcal{P} \cap \mathbb{R}^d_{\varepsilon}$ is unimodularly…