Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions

DOI10.1007/BF02761163zbMath0572.52006OpenAlexW2062068855MaRDI QIDQ1062277

Gil Kalai

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1007/bf02761163

zbMATH Keywords

simplicial complexnervefamily of convex setsnecessity of the condition of Eckhoff

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (33)

Leray numbers of complexes of graphs with bounded matching number ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Some homological properties of Borel type ideals ⋮ Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions ⋮ A combinatorial decomposition of simplicial complexes ⋮ Families of convex sets having convex union ⋮ Hyperconnectivity of graphs ⋮ A generalized Macaulay theorem and generalized face rings ⋮ P.L.-spheres, convex polytopes, and stress ⋮ An extended Euler-Poincaré theorem ⋮ The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes ⋮ On \(f\)-vectors and Betti numbers of multicomplexes ⋮ Turán, involution and shifting ⋮ The Upper‐Bound Theorem for Families of Boxes in ℝ ^d ⋮ On open and closed convex codes ⋮ Broken circuit complexes: Factorizations and generalizations ⋮ Hilbert functions of \(d\)-regular ideals ⋮ Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs ⋮ Algebraic shifting of strongly edge decomposable spheres ⋮ What Makes a Neural Code Convex? ⋮ Algebraic shifting and basic constructions on simplicial complexes ⋮ Quantitative \((p, q)\) theorems in combinatorial geometry ⋮ Lefschetz properties and basic constructions on simplicial spheres ⋮ Bipartite rigidity ⋮ Algebraic Shifting and Exterior and Symmetric Algebra Methods ⋮ Intersection patterns of convex sets ⋮ Petruska's question on planar convex sets ⋮ Dimension gaps between representability and collapsibility ⋮ Ideals with stable Betti numbers ⋮ Iterated homology of simplical complexes ⋮ A Mélange of Diameter Helly-Type Theorems ⋮ Helly-type problems ⋮ f-vectors of acyclic complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• Hyperconnectivity of graphs
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• d-collapsing and nerves of families of convex sets
• Hilbert functions of graded algebras
• A simple proof of the Kruskal-Katona theorem
• The numbers of faces of simplicial polytopes
• Sur la forme des espaces topologiques et sur les points fixes des représentations
• Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
• Über einen Satz von Kruskal

This page was built for publication: Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions