On a lemma of Minkowski (Q1307427): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: István Talata / rank | |||
Property / author | |||
Property / author: István Talata / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1004689911234 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1856810644 / rank | |||
Normal rank |
Latest revision as of 09:29, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a lemma of Minkowski |
scientific article |
Statements
On a lemma of Minkowski (English)
0 references
31 October 1999
0 references
The translative number (lattice kissing number) of a convex body \(K\) is the maximum of neighbours that a member can have in a packing (lattice packing) with translates of \(K\). The author proves a generalization of Minkowski lemma concerning the number of common points of the boundary of \(K\) and a lattice and shows that this result can be applied to solve two problems concerning kissing numbers of convex bodies. In the first application the author gives a short proof showing that the lattice kissing number of a tetrahedron \(T\) is eighteen and there exists a unique 18-neighbour lattice packing of \(T\) and an essentially unique 16-neighbour lattice packing of \(T\). Secondly, it is shown that for every dimension \(d\geq 3\) there exists a \(d\)-dimensional convex body \(K\) such that the difference between its translative kissing number and lattice kissing number is at least \(2^{d-1}\).
0 references
lattice
0 references
convex body
0 references
kissing number
0 references