Rigidity of symmetric simplicial complexes and the lower bound theorem
From MaRDI portal
Publication:6668342
DOI10.1017/FMS.2024.150MaRDI QIDQ6668342FDOQ6668342
Authors: James Cruickshank, Bill Jackson, Shin-Ichi Tanigawa 
Publication date: 22 January 2025
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of simplicial complexes (05E45) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cites Work
- Partial Differential Relations
- Infinitesimal rigidity of symmetric bar-joint frameworks
- The Rigidity of Graphs
- The number of faces of a simplicial convex polytope
- A proof of the lower bound conjecture for convex polytopes
- Title not available (Why is that?)
- A counterexample to the rigidity conjecture for polyhedra
- Lower-bound theorems for pseudomanifolds
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- Rigidity and the lower bound theorem. I
- A rigidity criterion for non-convex polyhedra
- On Kalai's conjectures concerning centrally symmetric polytopes
- On the number of faces of centrally-symmetric simplicial polytopes
- Combinatorics of polytopes with a group of linear symmetries of prime power order
- On face numbers of rational simplicial polytopes with symmetry
- Mémoire sur la théorie de l'octaèdre articulé.
- A lower bound theorem for centrally symmetric simplicial polytopes
- Highly neighborly centrally symmetric spheres
- Global rigidity of triangulated manifolds
This page was built for publication: Rigidity of symmetric simplicial complexes and the lower bound theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668342)
