A characterization of simplicial polytopes with g₂=1

DOI10.1016/J.JCTA.2009.12.011zbMATH Open1209.52007arXiv0804.1813OpenAlexW2099581288MaRDI QIDQ618296FDOQ618296

Eyal Novinsky, Eran Nevo

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0804.1813

Recommendations

• A characterization of homology manifolds with \(g_{2}\geq 2\)
• Triangulations of simplicial polytopes
• Skeletal rigidity of simplicial complexes. II
• A note on the simplex-cosimplex problem
• On the generalized lower bound conjecture for polytopes and spheres

zbMATH Keywords

polytopegraph rigidityhomology sphere

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) (n)-dimensional polytopes (52B11)

Cites Work

• Title not available (Why is that?)
• The minimum number of vertices of a simple polytope
• Lectures on Polytopes
• Title not available (Why is that?)
• Many triangulated spheres
• Partial Differential Relations
• The Rigidity 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
• A proof of the lower bound conjecture for convex polytopes
• Title not available (Why is that?)
• The rigidity of graphs. II
• Spheres with few vertices
• Graph theorems for manifolds
• Minimal triangulations of sphere bundles over the circle
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topological finiteness for edge-vertex enumeration
• Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groups
• Rigidity and the lower bound theorem. I
• Domination numbers and homology
• The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold
• Manifolds with few vertices
• Skeletal rigidity of simplicial complexes. II
• Higher minors and van Kampen's obstruction
• A characterization of simplicial polytopes with \(g_{2}=1\)

Cited In (15)

• Topological and combinatorial characterizations of normal 3-pseudomanifolds with \(g_2 \leq 5\)
• Title not available (Why is that?)
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
• The flag $f$-vectors of Gorenstein* order complexes of dimension $3$
• The rigidity of the graphs of homology spheres minus one edge
• On \(\gamma \)-vectors satisfying the Kruskal-Katona inequalities
• Bounds for Entries of $\gamma$-Vectors of Flag Homology Spheres
• Three-dimensional normal pseudomanifolds with relatively few edges
• A characterization of homology manifolds with \(g_{2}\geq 2\)
• Affine stresses: the partition of unity and Kalai's reconstruction conjectures
• A characterization of simplicial polytopes with \(g_{2}=1\)
• Global rigidity of triangulated manifolds
• A characterization of normal 3-pseudomanifolds with at most two singularities
• 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)