Reconstructing simplicial polytopes from their graphs and affine 2-stresses

DOI10.1007/s11856-022-2459-3zbMath1525.51014arXiv2106.09284OpenAlexW4313562459MaRDI QIDQ6165195

Isabella Novik, Hailun Zheng

Publication date: 31 July 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polytopesrigidity theory\(k\)-skeleton

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Hypergraphs (05C65) Polyhedra and polytopes; regular figures, division of spaces (51M20) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Many neighborly polytopes and oriented matroids
• Triangulated n-manifolds are determined by their \([n/2+1\)-skeletons]
• On the graph structure of convex polyhedra in \(n\)-space
• Hyperplane arrangements with a lattice of regions
• Neighborly polytopes
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• The number of faces of a simplicial convex polytope
• The rigidity of graphs. II
• Skeletal rigidity of simplicial complexes. I
• Skeletal rigidity of simplicial complexes. II
• Weights on polytopes
• P.L.-spheres, convex polytopes, and stress
• Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
• Lectures on Polytopes
• Convex Polytopes