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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
