The hypermetric cone and polytope on eight vertices and some generalizations

DOI10.1016/j.jsc.2016.01.009zbMath1390.68716OpenAlexW2789371466MaRDI QIDQ1745770

Mathieu Dutour Sikirić, Michel Marie Deza

Publication date: 18 April 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.01.009

zbMATH Keywords

cut polytopeDelaunay polytopescentral symmetrymetric conehypermetricdual description

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items

Unnamed Item ⋮ The Hypermetric Cone on Seven Vertices

Uses Software

• 4ti2
• PORTA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting and separation procedures for the cut polytope
• Optimal cuts in graphs and statistical mechanics
• Matroids and multicommodity flows
• Computing extreme rays of the metric cone for seven points
• A cone of inhomogeneous second-order polynomials
• Regular Dirichlet-Voronoi partitions for the second triclinic group
• All the facets of the six-point Hamming cone
• A classification of the six-point prime metrics
• There are exactly 222 \(L\)-types of primitive five-dimensional lattices
• All facets of the cut cone \(C_ n\) for \(n=7\) are known
• Combinatorial optimization and small polytopes
• A generalization of Voronoi's reduction theory and its application
• Smoothness and singularities of the perfect form and the second Voronoi compactification of Ag
• Enumeration of the facets of cut polytopes over some highly symmetric graphs
• Voronoi Diagrams and Delaunay Triangulations
• Complexity and algorithms for computing Voronoi cells of lattices
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• The Hypermetric Cone on Seven Vertices
• The complete classification of five-dimensional Dirichlet–Voronoi polyhedra of translational lattices
• The Seven Dimensional Perfect Delaunay Polytopes and Delaunay Simplices
• On classifying Minkowskian sublattices
• Guide to Computational Geometry Processing
• Discrete and Computational Geometry
• Geometry of cuts and metrics
• Combinatorial optimization. Theory and algorithms.
• Non-rigidity degree of a lattice and rigid lattices