Bier spheres and posets

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages. Revised and slightly extended version; last section rewritten

Scientific paper

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n-2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his construction as giving the poset of all the intervals in a boolean algebra that "cut across an ideal." Thus we arrive at a substantial generalization of Bier's construction: the Bier posets Bier(P,I) of an arbitrary bounded poset P of finite length. In the case of face posets of PL spheres this yields cellular "generalized Bier spheres." In the case of Eulerian or Cohen-Macaulay posets P we show that the Bier posets Bier(P,I) inherit these properties. In the boolean case originally considered by Bier, we show that all the spheres produced by his construction are shellable, which yields "many shellable spheres", most of which lack convex realization. Finally, we present simple explicit formulas for the g-vectors of these simplicial spheres and verify that they satisfy a strong form of the g-conjecture for spheres.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bier spheres and posets 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 Bier spheres and posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bier spheres and posets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-406561

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.