## 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.

Original language | English |
---|---|

Pages (from-to) | 387-395 |

Number of pages | 9 |

Journal | Journal of Combinatorial Theory. Series A |

Volume | 118 |

Issue number | 2 |

DOIs | |

State | Published - 1 Jan 2011 |

Externally published | Yes |

## 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 g_{2}=1'. Together they form a unique fingerprint.