Related papers: Lattice polytopes with distinct pair-sums
We show that all stack-sorting polytopes are simplices. Furthermore, we show that the stack-sorting polytopes generated from $Ln1$ permutations have relative volume 1. We establish an upper bound for the number of lattice points in a…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…
In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…
The $n$-dimensional lattice polytopes $\mathcal{Q}_{n,k}$ obtained by intersecting the $n$th dilate of the standard $n$-dimensional simplex in $\mathbb{R}^n$ with the half-spaces $x_i \le 1$ for $1 \le i \le k$ form an interesting special…
The duality between a class of the Davey-Stewartson type coupled systems and a class of two-dimensional Toda type lattices is discussed. A new coupled system related to the recently found lattice is presented. A method for eliminating…
For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…
The toric residue is a map depending on n+1 semi-ample divisors on a complete toric variety of dimension n. It appears in a variety of contexts such as sparse polynomial systems, mirror symmetry, and GKZ hypergeometric functions. In this…
A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…
This paper provides an estimate of the sum of a homogeneous polynomial $P$ of degree $\nu$ and mean zero over the lattice points inside a sphere of radius $R$. It is proved that $$ \sum_{\mathbf x \in \mathbb Z^3 \atop |\mathbf x| \le R}…