Related papers: The cyclicity rank of empty lattice simplices
Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…
An empty simplex is a lattice simplex in which vertices are the only lattice points. We show two constructions leading to the first known empty simplices of width larger than their dimension: - We introduce cyclotomic simplices and…
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…
A lattice $d$-simplex is the convex hull of $d+1$ affinely independent integer points in ${\mathbb R}^d$. It is called empty if it contains no lattice point apart of its $d+1$ vertices. The classification of empty $3$-simplices is known…
An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by White in 1964. In dimension four, the same task was started in 1988 by Mori, Morrison, and Morrison,…
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…
We give an almost complete classification of empty lattice simplices in dimension 4 using the conjectural results of Mori-Morrison-Morrison, later proved by Sankaran and Bober. In particular, all of these simplices correspond to cyclic…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
An n-dimensional simplex \Delta in \R^n is called empty lattice simplex if \Delta \cap\Z^n is exactly the set of vertices of \Delta . A theorem of G. K. White shows that if n=3 then any empty lattice simplex \Delta \subset\R^3 is isomorphic…
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.…
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most $V$ in $\mathbb{Z}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor…
We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…
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…
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.
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
Let $\delta(\Pc) = (\delta_0, \delta_1,..., \delta_d)$ be the $\delta$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $\delta$-vectors with $\sum_{i=0}^d \delta_i \leq…
The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…