Lifting simplicial complexes to the boundary of convex polytopes

DOI10.1016/j.disc.2012.06.005zbMath1251.52005OpenAlexW2045966071MaRDI QIDQ449125

Lionel Pournin

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.005

zbMATH Keywords

triangulationsGale duality\(k\)-regularityflip-graphpolytope projections

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Connectivity (05C40)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly regular subdivisions
• Constrained paths in the flip-graph of regular triangulations
• Triangulations. Structures for algorithms and applications
• Fiber polytopes
• The number of geometric bistellar neighbors of a triangulation
• The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected
• Nonregular triangulations of products of simplices
• Non-connected toric Hilbert schemes
• A result on flip-graph connectivity
• From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis
• The hyperdeterminant and triangulations of the 4-cube
• Cellular Strings on Polytopes
• Lectures on Polytopes
• Triangulations of cyclic polytopes and higher Bruhat orders
• A point set whose space of triangulations is disconnected
• Convex Polytopes

This page was built for publication: Lifting simplicial complexes to the boundary of convex polytopes