Related papers: Ehrhart polynomials of cyclic polytopes
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
Eberhard-type theorems are statements about the realizability of a polytope (or more general polyhedral maps) given the valency of its vertices and sizes of its polygonal faces up to a linear linear degree of freedom. We present new…
A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…
We compute the exact value of the Bohr radius associated to an elliptic condenser of the complex plane and its Faber polynomial basis.
We present a formula for the degree of the discriminant of a smooth projective toric variety associated to a lattice polytope P, in terms of the number of integral points in the interior of dilates of faces of dimension greater or equal…
We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…
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…
We introduce several classes of polytopes contained in $[0,1]^n$ and cut out by inequalities involving sums of consecutive coordinates. We show that the normalized volumes of these polytopes enumerate circular extensions of certain partial…
Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…
We describe a method for computing the highest degree coefficients of a weighted Ehrhart quasi-polynomial for a rational simple polytope.
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
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) =…
In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
This paper gives an explicit formula for the Ehrhart quasi-polynomial of certain 2-dimensional polyhedra in terms of invariants of surface quotient singularities. Also, a formula for the dimension of the space of quasi-homogeneous…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…
A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…