On the width of lattice-free simplices (Q4267399)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1347165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the width of lattice-free simplices |
scientific article; zbMATH DE number 1347165 |
Statements
4 October 1999
0 references
lattice polytopes
0 references
lattice points
0 references
0.8231678009033203
0 references
0.8212361931800842
0 references
0.806414008140564
0 references
By a lattice-free simplex \(T\) the author means that \(T\cap \mathbb{Z}^d= \text{vert} T\), i.e. the vertices are the only lattice points of \(T\). Further the width is the so-called lattice width, which is relevant in Geometry of Numbers and integer optimization. The author proves that for any \(\alpha >0\) with \(\alpha<e^{-1}\), if \(d\) is large enough, there is a lattice-free simplex of dimension \(d\) and width \(\alpha d\). The proof is nonconstructive and elegant and uses elementary methods.
0 references