Related papers: Computing parametric weighted Ehrhart polynomials …
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…
We describe a method for computing the highest degree coefficients of a weighted Ehrhart quasi-polynomial for a rational simple polytope.
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…
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,…
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…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
We use a version of localization in equivariant cohomology for the norm-square of the moment map, described by Paradan, to give several weighted decompositions for simple polytopes. As an application, we study Euler-Maclaurin formulas.
We give an Euler-Maclaurin formula with remainder for the weighted sum of the values of a smooth function on the integral points in a simple integral polytope. Our work generalizes the formula obtained by Karshon, Sternberg and Weitsman in…
A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…
The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…
We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…
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…
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…
In Ehrhart theory, the $h^*$-vector of a rational polytope often provide insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic…
As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…
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…
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…