On the number of convex lattice polytopes
From MaRDI portal
Publication:2366288
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).
Recommendations
Cites work
- Conditions for similarity to unitary and self-adjoint operators
- scientific article; zbMATH DE number 3858857 (Why is no real title available?)
- scientific article; zbMATH DE number 3436238 (Why is no real title available?)
- scientific article; zbMATH DE number 3213005 (Why is no real title available?)
- scientific article; zbMATH DE number 3399320 (Why is no real title available?)
- scientific article; zbMATH DE number 3078611 (Why is no real title available?)
- Integer points on curves and surfaces
- The difference body of a convex body
Cited in
(44)- Computing the Ehrhart polynomial of a convex lattice polytope
- Lattice-free polytopes and their diameter
- An output sensitive algorithm for discrete convex hulls
- Lattice polytopes with distinct pair-sums
- A discrete version of Koldobsky's slicing inequality
- The limit shape of convex lattice polygons
- Probabilistic approach to the analysis of statistics for convex polygonal lines
- The limit shape of convex lattice polygons and related topics
- On finitely generated closures in the theory of cutting planes
- On the number of lattice free polytopes
- Borsuk's partition conjecture
- Tropically planar graphs
- The mixed degree of families of lattice polytopes
- On lattice points in polyhedral cross-sections
- On a question of V.~I.~Arnol'd
- Skyscraper polytopes and realizations of plane triangulations
- The element number of the convex regular polytopes
- Approximation of convex sets by polytopes
- A Counting Formula for Primitive Tetrahedra in Z 3
- The number of configurations in lattice point counting. II
- On the classification of convex lattice polytopes
- Convex curves and a Poisson imitation of lattices
- On Counting Lattice Points in Polyhedra
- Existence of unimodular triangulations -- positive results
- scientific article; zbMATH DE number 4155333 (Why is no real title available?)
- Random points and lattice points in convex bodies
- Enumeration of Almost-Convex Polygons on the Square Lattice
- scientific article; zbMATH DE number 1305341 (Why is no real title available?)
- On the Number of Convex Lattice Polygons
- Convex polygons in Cartesian products
- On the classification of convex lattice polytopes. II
- scientific article; zbMATH DE number 3892086 (Why is no real title available?)
- Approximate profile maximum likelihood
- Cutting corners
- A method of deducing \(L\)-polyhedra for \(n\)-lattices
- Bounds on the number of higher-dimensional partitions
- Cells in the box and a hyperplane
- The volume polynomial of lattice polygons
- Lattice angles of lattice polygons
- Fluctuations of lattice zonotopes and polygons
- Number of convex sublattices of a lattice
- On lattice diameter segments: algorithms and structure
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- Classification of lattice-regular lattice convex polytopes
This page was built for publication: On the number of convex lattice polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366288)
