A characterization of simplicial polytopes with g2=1

Eran Nevo, Eyal Novinsky

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

Kalai proved that the simplicial polytopes with g2=0 are the stacked polytopes. We characterize the g2=1 case.Specifically, we prove that every simplicial d-polytope (d≥4) which is prime and with g2=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 g2=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 g2=1, and our proof takes advantage of working with this larger class of complexes.

Original languageEnglish
Pages (from-to)387-395
Number of pages9
JournalJournal of Combinatorial Theory. Series A
Volume118
Issue number2
DOIs
StatePublished - 1 Jan 2011
Externally publishedYes

Keywords

  • Graph rigidity
  • Homology sphere
  • Polytope

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'A characterization of simplicial polytopes with g2=1'. Together they form a unique fingerprint.

Cite this