A characterization of simplicial polytopes with g₂=1
From MaRDI portal
Publication:618296
Abstract: Kalai proved that the simplicial polytopes with g_2=0 are the stacked polytopes. We characterize the g_2=1 case. Specifically, we prove that every simplicial d-polytope (d>=4) which is prime and with g_2=1 is combinatorially equivalent either to a free sum of two simplices whose dimensions add up to d (each of dimension at least 2), or to a free sum of a polygon with a (d-2)-simplex. Thus, every simplicial d-polytope (d>=4) with g_2=1 is combinatorially equivalent to a polytope obtained by stacking over a polytope as above. Moreover, the above characterization holds for any homology (d-1)-sphere (d>=4) with g_2=1, and our proof takes advantage of working with this larger class of complexes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3868113 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3493472 (Why is no real title available?)
- scientific article; zbMATH DE number 665689 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- A characterization of simplicial polytopes with \(g_{2}=1\)
- A proof of the lower bound conjecture for convex polytopes
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Domination numbers and homology
- Graph theorems for manifolds
- Higher minors and van Kampen's obstruction
- Lectures on Polytopes
- Manifolds with few vertices
- Many triangulated spheres
- Minimal triangulations of sphere bundles over the circle
- Partial Differential Relations
- Rigidity and the lower bound theorem. I
- Skeletal rigidity of simplicial complexes. II
- Spheres with few vertices
- The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold
- The Rigidity of Graphs
- The minimum number of vertices of a simple polytope
- The number of faces of a simplicial convex polytope
- The rigidity of graphs. II
- Topological finiteness for edge-vertex enumeration
- Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groups
Cited in
(15)- Topological and combinatorial characterizations of normal 3-pseudomanifolds with \(g_2 \leq 5\)
- scientific article; zbMATH DE number 7203478 (Why is no real title available?)
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- The rigidity of the graphs of homology spheres minus one edge
- On -vectors satisfying the Kruskal-Katona inequalities
- Three-dimensional normal pseudomanifolds with relatively few edges
- A characterization of homology manifolds with \(g_{2}\geq 2\)
- The flag f-vectors of Gorenstein^ order complexes of dimension 3
- Affine stresses: the partition of unity and Kalai's reconstruction conjectures
- A characterization of simplicial polytopes with \(g_{2}=1\)
- Bounds for entries of \(\gamma\)-vectors of flag homology spheres
- A characterization of normal 3-pseudomanifolds with at most two singularities
- Global rigidity of triangulated manifolds
- Average Betti numbers of induced subcomplexes in triangulations of manifolds
- The generic anisotropy of simplicial 1-spheres
This page was built for publication: A characterization of simplicial polytopes with \(g_{2}=1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618296)