scientific article; zbMATH DE number 1341996
This paper gives upper bounds for the Betti numbers of shellable simplicial complexes with a given number of vertices and facets, and of the boundary complex of simplicial polytopes that admit a shellable triangulation with no interior vertices. In the first case the upper bound is tight and it is reached by the so-called \((d-1)\)-trees (they are generalizations of stacked polytopes). These bounds are of current interest due to a result of Terai that says that for \(3\)-polytopes with a given number of vertices the boundary complex of a stacked polytope has the maximal Betti numbers. Notice for example that the second bound can be sharpened by finding shellable triangulations that use very few simplices. For the entire collection see [Zbl 0913.00044].
- Diagonalen in Simplizialkomplexen. (Diagonals in simplicial complexes)
- Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers.
- On modular homology of simplicial complexes: Saturation
- Average Betti numbers of induced subcomplexes in triangulations of manifolds
- Graded Betti numbers of balanced simplicial complexes
- Simplicial shellable spheres via combinatorial blowups
- Simplicial matrix-tree theorems
- Extremal problems related to Betti numbers of flag complexes
- Shellability of simplicial complexes and simplicial complexes with the free vertex property
- Betti numbers of complexes with highly connected links
- Betti numbers of the geometric spaces associated to nonrational simple convex polytopes
- On the Betti Numbers of Shifted Complexes of Stable Simplicial Complexes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263563)
