Related papers: Multiples of lattice polytopes without interior la…

An $(n-1)$-tuple $a = (a(1), \dots, a(n-1))$ consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers $N$ such that the convex hull, $K(a(n))$, in $n$-dimensional Euclidean space…

For every integer $n$ with $n \geq 4$, we prove that the local dimension of a poset consisting of all the subsets of $\{1,\dots,n\}$ equipped with the inclusion relation is strictly less than $n$, answering a question of Kim, Martin,…

Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent…

In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and…

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…

Non-rigidity degree of a lattice $L$, nrd$L$, is dimension of the L-type domain to which $L$ belongs. We complete here the table of nrd's of all root lattices and their duals; namely, the hardest remaining case of $D_n^*$, and the case of…

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and…

Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given $n\in\mathbb{N}$ and a unimodular $2$-simplex $\Delta$ what is the maximal number of vertices a lattice polytope…

For a minimal inequality derived from a maximal lattice-free simplicial polytope in $\R^n$, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers $\R^n$. We then use this…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

We associate to lattice points a_0,a_1,...,a_N in Z^n an A-hypergeometric series \Phi(\lambda) with integer coefficients. If a_0 is the unique interior lattice point of the convex hull of a_1,...,a_N, then for every prime p\neq 2 the ratio…

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…

A complete classification of the $\delta$-vectors of lattice polytopes whose normalized volumes are at most $4$ is known. In the present paper, we will classify all the $\delta$-vectors of lattice polytopes with normalized volumes $5$.

Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained models with two integer variables under the assumption that all…

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as…

We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…

We prove that in each dimension $d$ there is a constant $w^\infty(d)\in \mathbb{N}$ such that for every $n\in \mathbb{N}$ all but finitely many $d$-polytopes with $n$ lattice points have width at most $w^\infty(d)$. We call $w^\infty(d)$…

Let $X=\{x_1,\ldots,x_n\} \subset \mathbb R^d$ be an $n$-element point set in general position. For a $k$-element subset $\{x_{i_1},\ldots,x_{i_k}\} \subset X$ let the degree ${\rm deg}_k(x_{i_1},\ldots,x_{i_k})$ be the number of empty…