Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes

DOI10.1007/s00454-007-9017-yzbMath1141.52013MaRDI QIDQ2482194

Eran Nevo

Publication date: 16 April 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-007-9017-y

zbMATH Keywords

doubly Cohen-Macaulay complex; generically rigid; lower bound inequalities; M-sequence.

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

Related Items

Buchsbaum\(^*\) complexes, Lower bounds for Buchsbaum\(^*\) complexes, \(f\)-vectors of triangulated balls, Balanced complexes and complexes without large missing faces, \(g\)-elements, finite buildings and higher Cohen-Macaulay connectivity.

Cites Work

• Rigidity and the lower bound theorem. I
• \(g\)-elements, finite buildings and higher Cohen-Macaulay connectivity.
• Hyperconnectivity of graphs
• 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
• Cohen-Macaulay quotients of polynomial rings
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• The Rigidity of Graphs
• Non-Separable and Planar Graphs
• Unnamed Item
• Unnamed Item