On the number of convex lattice polytopes (Q2366288)
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 223599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of convex lattice polytopes |
scientific article; zbMATH DE number 223599 |
Statements
On the number of convex lattice polytopes (English)
0 references
29 June 1993
0 references
Two convex lattice polytopes of the integer lattice \(\mathbb{Z}^ d\) are called equivalent if there is a lattice preserving affine transformation mapping one to the other. Equivalent lattice polytopes the have same volume. Let \(N_ d(A)\) be the number of non-equivalent lattice polytopes of volume \(A\) in \(R^ d\). Then the authors prove \(\log N_ d(A) \ll A^{(d-1)/(d+1)}\), hence improving on a result by Konyagin and Sevastyanov (1984).
0 references
convex lattice polytopes
0 references
0.8693119883537292
0 references
0.8484469056129456
0 references
0.8467352390289307
0 references
