Bier Spheres and Posets
@article{Bjrner2005BierSA, title={Bier Spheres and Posets}, author={A. Bj{\"o}rner and A. Paffenholz and Jonas Sj{\"o}strand and G. Ziegler}, journal={Discrete & Computational Geometry}, year={2005}, volume={34}, pages={71-86} }
Abstract
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… CONTINUE READING
Topics from this paper
19 Citations
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2008
- 6
- PDF
References
SHOWING 1-10 OF 55 REFERENCES
The Et-Construction for Lattices,
Spheres and Polytopes
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2004
- 22
- PDF
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry
- Mathematics
- 2007
- 241
Upper bounds for configurations and polytopes inRd
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1986
- 122
- PDF