Related papers: Ehrhart quasi-polynomials and parallel translation…
Alcoved polytopes are convex polytopes, which are the closure of a union of alcoves in an affine Coxeter arrangement. They are rational polytopes and, therefore, have Ehrhart quasipolynomials. Here we describe a method for computing the…
We study the Ehrhart theory of quadratic irrational polytopes that undergo vector dilations. That is, for a given polytope with vertices in $\mathbb{Q}(\sqrt{D})$, and a different dilation factor for each facet, we show that the leading…
We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…
When extending the Ehrhart lattice point enumerator $L_P(t)$ to allow real dilation parameters $t$, we lose the invariance under integer translations that exists when $t$ is restricted to be an integer. This paper studies this phenomenon;…
In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…
For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is a certain integral polytope in $\mathbb{R}^m$, which can be defined as the convex hull of the vectors from $\{0,1,\ldots,n\}^m$ whose nonzero entries are…
We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart…
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…
To any poset or quasi-poset is attached a lattice polytope, whose Ehrhart polynomial we study from a Hopf-algebraic point of view. We use for this two interacting bialgebras on quasi-posets. The Ehrhart polynomial defines a Hopf algebra…
The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…
In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes containing the origin $P$ and $Q$ in terms of the enumerative combinatorics of $P$ and $Q$. This generalizes work of Beck, Jayawant, McAllister, and…
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…
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…
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…