A characterization of simplicial polytopes with g_2=1

Details A characterization of simplicial polytopes with g_2=1 A characterization of simplicial polytopes with g_2=1

2008-04-10

arxiv.org/abs/0804.1813v2

Mathematics

Combinatorics

12 pages. Improved presentation thanks to suggestions of referees and slightly improved results

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A characterization of simplicial polytopes with g_2=1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A characterization of simplicial polytopes with g_2=1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A characterization of simplicial polytopes with g_2=1 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705298