On the classification of convex lattice polytopes

DOI10.1515/ADVGEOM.2011.031zbMath1243.52011arXiv1103.0103MaRDI QIDQ3096812

Heling Liu, Chuan Ming Zong

Publication date: 14 November 2011

Published in: advg (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.0103

zbMATH Keywords

convex lattice polytopescentrally symmetric lattice polygons

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Related Items

Ehrhart tensor polynomials, A comprehensive survey of brane tilings, Lattice 3-polytopes with few lattice points, Borsuk's partition conjecture

Cites Work

• A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
• Sums, projections, and sections of lattice sets, and the discrete covariogram
• A Brunn-Minkowski inequality for the integer lattice
• Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
• On the Number of Convex Lattice Polygons
• Lattice points in lattice polytopes
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.