The flip-graph of the 4-dimensional cube is connected
From MaRDI portal
Publication:1953054
DOI10.1007/s00454-013-9488-yzbMath1267.05156arXiv1201.6543MaRDI QIDQ1953054
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
tesseract; enumeration; triangulations; \(k\)-regularity; 4-dimensional hypercube; flip-graph connectivity; TOPCOM
52B11: (n)-dimensional polytopes
52B55: Computational aspects related to convexity
05C65: Hypergraphs
05C40: Connectivity
Related Items
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item