相关论文: Classification of empty lattice $4$-simplices of w…
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,…
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…
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…
We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…
We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…
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…
We are interested in algebraic properties of empty lattice simplices $\Delta$, that is, $d$-dimensional lattice polytopes containing exactly $d+1$ points of the integer lattice $\mathbb{Z}^d$. The cyclicity rank of $\Delta$ is the minimal…
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…
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…
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…
We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…
The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of 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)$…
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 set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
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…
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…
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 propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…
Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…