Related papers: Multiples of lattice polytopes without interior la…

Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this paper we explore this correspondence to classify smooth lattice polytopes…

We show that h*-vectors of alcoved polytopes P in R^n (of Lie type A) are unimodal if they contain interior lattice points and their facets have lattice distance 1 to the set of interior lattice points. The maximal possible such distance…

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $\delta(\Pc)=(\delta_0, \delta_1,..., \delta_d)$ the $\delta$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^d\delta_i$ its normalized volume. In this paper, we will…

Consider a class of simplices defined by systems $A x \leq b$ of linear inequalities with $\Delta$-modular matrices. A matrix is called $\Delta$-modular, if all its rank-order sub-determinants are bounded by $\Delta$ in an absolute value.…

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…

Let $I$ be a monomial ideal in the polynomial ring $S$ generated by elements of degree at most $d$. In this paper, it is shown that, if the $i$-th syzygy of $I$ has no element of degrees $j, \ldots, j+(d-1)$ (where $j \geq i+d$), then…

A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…

The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…

An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

Let g be a finite dimensional semisimple Lie algebra over C and e be a nilpotent element. Elashvili and Kac have recently classified all good Z-gradings for e. We instead consider good R-gradings, which are naturally parameterized by an…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…

Let $d>k$ be positive integers. Motivated by an earlier result of Bugeaud and Nguyen, we let $E_{k,d}$ be the set of $(c_1,\ldots,c_k)\in\mathbb{R}_{\geq 0}^k$ such that…

Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…

In this paper we define and investigate a class of polytopes which we call "vertex generated" consisting of polytopes which are the average of their $0$ and $n$ dimensional faces. We show many results regarding this class, among them: that…