The flip-graph of the 4-dimensional cube is connected

DOI10.1007/S00454-013-9488-YzbMath1267.05156arXiv1201.6543OpenAlexW3100257390MaRDI QIDQ1953054

Lionel Pournin

Publication date: 7 June 2013

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

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

zbMATH Keywords

tesseractenumerationtriangulations\(k\)-regularity4-dimensional hypercubeflip-graph connectivityTOPCOM

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Hypergraphs (05C65) Connectivity (05C40)

Related Items (3)

Parallel enumeration of triangulations ⋮ The polyhedral geometry of truthful auctions ⋮ Geometry of fitness landscapes: peaks, shapes and universal positive epistasis

Uses Software

• TOPCOM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting simplicial complexes to the boundary of convex polytopes
• Weakly regular subdivisions
• Triangulations. Structures for algorithms and applications
• Nonregular triangulations of products of simplices
• A result on flip-graph connectivity
• The hyperdeterminant and triangulations of the 4-cube
• A point set whose space of triangulations is disconnected

This page was built for publication: The flip-graph of the 4-dimensional cube is connected