Publication:161316: Difference between revisions
From MaRDI portal
Publication:161316
Created automatically from import240425040427 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Enumeration of lattice polytopes by their volume to Enumeration of lattice polytopes by their volume: Duplicate |
(No difference)
|
Latest revision as of 11:18, 29 April 2024
DOI10.48550/ARXIV.1811.03357zbMath1462.52022arXiv1811.03357OpenAlexW3011847229MaRDI QIDQ161316
Publication date: 8 November 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete enumeration of such equivalence classes for arbitrary constants d and K. The algorithm, which gives another proof of the finiteness result, is implemented for small values of K, up to dimension six. The resulting database contains and extends several existing ones, and has been used to correct mistakes in other classifications. When specialized to three-dimensional smooth polytopes, it extends previous classifications by Bogart et al., Lorenz and Lundman. Moreover, we give a structure theorem for smooth polytopes with few lattice points that proves that they have a quadratic triangulation and that we use, together with the classification, to describe smooth polytopes having small volume in arbitrary dimension. In dimension three we enumerate all the simplices having up to 11 interior lattice points and we use them to conjecture a set of sharp inequalities for the coefficients of the Ehrhart h*-polynomials, unifying several existing conjectures. Finally, we extract and discuss minimal interesting examples from the classification, and we study the frequency of properties such as being spanning, very ample, IDP, and having a unimodular cover or triangulation. In particular, we find the smallest polytopes which are very ample but not IDP, and with a unimodular cover but without a unimodular triangulation.
Full work available at URL: https://arxiv.org/abs/1811.03357
(n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Length, area, volume and convex sets (aspects of convex geometry) (52A38)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Enumeration of lattice 3-polytopes by their number of lattice points
- Lattice 3-polytopes with six lattice points
- Lattice 3-polytopes with few lattice points
- Moving out the edges of a lattice polygon
- Complete classification of reflexive polyhedra in four dimensions
- Very ample and Koszul segmental fibrations
- Lattice polytopes of degree 2
- Triangulations. Structures for algorithms and applications
- The classification of Fano 3-folds with torus embeddings
- On lattice polytopes having interior lattice points
- Lattice vertex polytopes with interior lattice points
- On the Hilbert function of a graded Cohen-Macaulay domain
- Classification of reflexive polyhedra in three dimensions
- On the classification of toric Fano 4-folds
- A lower bound theorem for Ehrhart polynomials of convex polytopes
- The Magma algebra system. I: The user language
- Toward the classification of higher-dimensional toric Fano varieties
- Universal inequalities in Ehrhart theory
- Mini-workshop: Lattice polytopes: methods, advances, applications. Abstracts from the mini-workshop held September 17--23, 2017
- On primitive subdivisions of an elementary tetrahedron.
- A classification of smooth convex 3-polytopes with at most 16 lattice points
- Classification of lattice polytopes with small volumes
- Local optimality of Zaks-Perles-Wills simplices
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
- Lower bounds on the coefficients of Ehrhart polynomials
- The minimum number of vertices of a simple polytope
- Extremal Properties for Dissections of Convex 3-Polytopes
- Additive Number Theory and Inequalities in Ehrhart Theory
- Unimodality problems in Ehrhart theory
- Canonical Toric Fano Threefolds
- Introduction to Toric Varieties. (AM-131)
- Inequalities and Ehrhart $\delta $-vectors
- Classification of toric Fano 5-folds
- Polytopes, Rings, and K-Theory
- SINGULAR TORIC FANO VARIETIES
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- On convex lattice polygons
- Normality and covering properties of affine semigroups
- Decompositions of Rational Convex Polytopes
- Lattice points in lattice polytopes
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- Computing the Continuous Discretely
Related Items (9)
Blown-up toric surfaces with non-polyhedral effective cone ⋮ Heron's formula in higher dimensions ⋮ On Intrinsic Negative Curves ⋮ Ehrhart polynomials of lattice polytopes with normalized volumes 5 ⋮ Sharp volume and multiplicity bounds for Fano simplices ⋮ Classification of triples of lattice polytopes with a given mixed volume ⋮ Polytopes.Lattice.SmallVolume ⋮ Low dimensional flow polytopes and their toric ideals ⋮ The characterisation problem of Ehrhart polynomials of lattice polytopes
This page was built for publication: Enumeration of lattice polytopes by their volume