On the number of convex lattice polytopes
From MaRDI portal
Publication:2366288
DOI10.1007/BF01896660zbMath0772.52010OpenAlexW2003172399MaRDI QIDQ2366288
Anatoly M. Vershik, Imre Bárány
Publication date: 29 June 1993
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/58105
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) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items
Computing the Ehrhart polynomial of a convex lattice polytope, Lattice-free polytopes and their diameter, The limit shape of convex lattice polygons, Probabilistic approach to the analysis of statistics for convex polygonal lines, Unnamed Item, CONVEX CURVES AND A POISSON IMITATION OF LATTICES, The limit shape of convex lattice polygons and related topics, Skyscraper polytopes and realizations of plane triangulations, On finitely generated closures in the theory of cutting planes, An output sensitive algorithm for discrete convex hulls, A discrete version of Koldobsky's slicing inequality, Bounds on the number of higher-dimensional partitions, Cells in the box and a hyperplane, Random points and lattice points in convex bodies, On the number of lattice free polytopes, John-type theorems for generalized arithmetic progressions and iterated sumsets, Classification of lattice-regular lattice convex polytopes, Cutting corners, Approximation of convex sets by polytopes, Existence of unimodular triangulations — positive results, Convex polygons in Cartesian products, Borsuk's partition conjecture, Tropically planar graphs
Cites Work
