Affine stresses: the partition of unity and Kalai's reconstruction conjectures
DOI10.1007/S00454-024-00642-0MaRDI QIDQ6624185
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the generalized lower bound conjecture for polytopes and spheres
- Tight combinatorial manifolds and graded Betti numbers
- Rigidity and the lower bound theorem. I
- Hard Lefschetz theorem for simple polytopes
- A characterization of simplicial polytopes with \(g_{2}=1\)
- P.l. homeomorphic manifolds are equivalent by elementary shellings
- \(g\)-elements, finite buildings and higher Cohen-Macaulay connectivity.
- The number of faces of a simplicial convex polytope
- The rigidity of graphs. II
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- On simple polytopes
- Domination numbers and homology
- A lower bound theorem for centrally symmetric simplicial polytopes
- Skeletal rigidity of simplicial complexes. I
- Skeletal rigidity of simplicial complexes. II
- Combinatorics and commutative algebra.
- Weights on polytopes
- P.L.-spheres, convex polytopes, and stress
- The rigidity of the graphs of homology spheres minus one edge
- The stresses on centrally symmetric complexes and the lower bound theorems
- Graph theorems for manifolds
- Toric chordality
- Some combinatorial properties of flag simplicial pseudomanifolds and spheres
- On stellated spheres and a tightness criterion for combinatorial manifolds
- A proof of the lower bound conjecture for convex polytopes
- A geometric lower bound theorem
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- The Rigidity of Graphs
- Lectures on Polytopes
- The Partition Complex: an invitation to combinatorial commutative algebra
- Face enumeration on flag complexes and flag spheres
- The maximum numbers of faces of a convex polytope
- On the anisotropy theorem of Papadakis and Petrotou
- Reconstructing simplicial polytopes from their graphs and affine 2-stresses
This page was built for publication: Affine stresses: the partition of unity and Kalai's reconstruction conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624185)
