English
Related papers

Related papers: Local Formulas for Ehrhart Coefficients from Latti…

200 papers

A lattice polytope is "free" (or "empty") if its vertices are the only lattice points it contains. In the context of valuation theory, Klain (1999) proposed to study the functions $\alpha_i(P;n)$ that count the number of free polytopes in…

Combinatorics · Mathematics 2021-02-23 Sebastian Manecke , Raman Sanyal

We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…

Combinatorics · Mathematics 2024-01-09 Guoce Xin , Xinyu Xu , Yingrui Zhang , Zihao Zhang

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…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

We extend to Barvinok's valuations the Euler-Maclaurin expansion formula which we obtained previously for the sum of values of a polynomial over the integral points of a rational polytope. This leads to an improvement of Barvinok's…

Combinatorics · Mathematics 2016-08-14 Velleda Baldoni , Nicole Berline , Michèle Vergne

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

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.…

Combinatorics · Mathematics 2018-04-24 Fu Liu , Liam Solus

We establish a connection between the orbifold cohomology of hypertoric varieties and the Ehrhart theory of Lawrence polytopes. More specifically, we show that the dimensions of the orbifold cohomology groups of a hypertoric variety are…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of \emph{non}-integral convex polygons. Define a \emph{pseudo-integral…

Combinatorics · Mathematics 2009-06-04 Tyrrell B. McAllister

We give a combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices. In a special case, where these polytopes coincide with the base polytope of the panhandle matroid $\textrm{Pan}_{k,n-2,n}$, we…

Combinatorics · Mathematics 2023-12-13 Daniel McGinnis

For $n\in\mathbb{N}$ and $\ell\in\{0,1,\dots,n\}$, we consider the function extracting the $\ell$th coefficient of the Ehrhart polynomials of lattice polytopes in $\mathbb{R}^n$. These functions form a basis of the space of unimodular…

Combinatorics · Mathematics 2025-07-17 Claudia Alfes , Joshua Maglione , Christopher Voll

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…

Combinatorics · Mathematics 2025-12-23 Vadym Kurylenko

A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…

Metric Geometry · Mathematics 2008-09-16 Nikolai Dolbilin , Egon Schulte

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…

Combinatorics · Mathematics 2021-10-05 Alan Stapledon

There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to…

Combinatorics · Mathematics 2021-10-05 Eric Katz , Alan Stapledon

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…

Combinatorics · Mathematics 2014-12-05 Alan Stapledon

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

Combinatorics · Mathematics 2025-12-10 Krishna Menon , Emil Verkama

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

Combinatorics · Mathematics 2024-02-20 Jesús A. De Loera , Laura Escobar , Nathan Kaplan , Chengyang Wang

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…

Combinatorics · Mathematics 2018-11-09 Gabriele Balletti