Lattice-free polytopes and their diameter

DOI10.1007/BF02574028zbMath0817.52018OpenAlexW2017624835MaRDI QIDQ1346126

Shmuel Onn, Michel Marie Deza

Publication date: 13 August 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131347

zbMATH Keywords

lattice polytoperegular polytopeDelaunay polytope[0,1-polytope]Schläfli polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Related Items

Saturation of Newton polytopes of type A and D cluster variables, Distance between vertices of lattice polytopes, Determination of social laws for multi-agent mobilization, The representation polyhedron of a semiorder., On lattice-free orbit polytopes, Elementary moves on lattice polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity in (0-1)-polyhedra
• The lattice polytope problem
• Lattice point simplices
• Covering minima and lattice-point-free convex bodies
• The ellipsoid method and its consequences in combinatorial optimization
• On the diameter of convex polytopes
• A monotonicity property of \(h\)-vectors and \(h^*\)-vectors
• The hypermetric cone is polyhedral
• The Hirsch conjecture is true for (0,1)-polytopes
• On the number of convex lattice polytopes
• Convexity in cristallographical lattices
• Layerwise construction ofL-bodies of lattices
• A counterexample to Borsuk’s conjecture
• The Intrinsic Spread of a Configuration in R d
• Integral Polyhedra in Three Space
• The d-Step Conjecture and Its Relatives
• The Empty Sphere
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Paths on Polytopes