Related papers: Lattice simplices of maximal dimension with a give…
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 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…
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,…
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…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
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 introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…
We present a procedure to improve the lattice definition of $\mathcal N = 4$ supersymmetric Yang--Mills theory. The lattice construction necessarily involves U(1) flat directions, and we show how these can be lifted without violating the…
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 lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…
We study the lattice width of lattice-free polyhedra given by $\mathbf{A}\mathbf{x}\leq\mathbf{b}$ in terms of $\Delta(\mathbf{A})$, the maximal $n\times n$ minor in absolute value of $\mathbf{A}\in\mathbb{Z}^{m\times n}$. Our main…
Let $\mathcal{T}^d(1)$ be the set of all $d$-dimensional simplices $T$ in $\real^d$ with integer vertices and a single integer point in the interior of $T$. It follows from a result of Hensley that $\mathcal{T}^d(1)$ is finite up to affine…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
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…
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
In this paper we show that if a compact set $E \subset \mathbb{R}^d$, $d \geq 3$, has Hausdorff dimension greater than $\frac{(4k-1)}{4k}d+\frac{1}{4}$ when $3 \leq d<\frac{k(k+3)}{(k-1)}$ or $d- \frac{1}{k-1}$ when $\frac{k(k+3)}{(k-1)}…
A consistent formulation of a fully supersymmetric theory on the lattice has been a long standing challenge. In recent years there has been a renewed interest on this problem with different approaches. At the basis of the formulation we…
There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…