Signable posets and partitionable simplicial complexes

Discrete and Computational Geometry

Volumn 15, Issue 4, 1996, Pages 443-466

  Kleinschmidt, P ^a   Onn, S ^b  

^a UNIVERSITY OF PASSAU   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030526410     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02711519     Document Type: Article

References (19)

1. L. J. Billera and J. S. Provan. Decomposition of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res., 5:576-594, 1980.
2. A. Björner. Homology and shellability of matroids and geometric lattices. In N. White, editor, Matroid Applications, chapter 7, pages 226-283. Cambridge University Press, Cambridge, 1992.
3. A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1993.
4. A. Björner and M. Wachs. On lexicographically shellable posets. Trans. Amer. Math. Soc., 277:323-341, 1983.
5. G. Danaraj and V. Klee. A representation of 2-dimensional pseudomanifolds and its use in the design of a linear-time shelling algorithm. Ann. Discrete Math., 2:53-63, 1977.
6. G. Danaraj and V. Klee. Which spheres are shellable? Annals of Discrete Mathematics, 2:33-52, 1978.
7. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, CA, 1979.
8. B. Kind and P. Kleinschmidt. Schälbare Cohen-Macaulay Komplexe und ihre Parametrisierung. Math. Z., 167:173-179, 1979.
9. P. Kleinschmidt and Z. Smilansky. New results for simplicial spherical polytopes. In J. E. Goodman, R. Pollack, and W. Steiger, editors, Special Year on Discrete and Computational Geometry, pages 187-197. DIMACS Series, vol. 6. American Mathematical Society, Providence, RI, 1991.
10. M. Las Vergnas. Convexity in oriented matroids. J. Combin. Theory Ser. B, 29:231-243, 1980.
11. N. Linial. Hard enumeration problems in geometry and combinatorics. SIAM J. Algebraic Discrete Methods, 7:331-335, 1986.
12. P. Mani-Levitska. Convex polytopes and smooth +structures on manifolds. Euroconference on Combinatorial Geometry, Crete, July 1994.
13. P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika, 17:179-184, 1970.
14. S. D. Noble. Recognizing a partitionable simplicial complex is in NP. Discr. Math., to appear.
15. S. Onn. Partitionable Posets. Manuscript. 20 pages, 1995.
16. R. Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face. Proc. 18th Ann. ACM Symp. on Theory of Computing, pages 404-413, 1986.
17. R. P. Stanley. Combinatorics and Commutative Algebra. Birkhäuser, Boston, 1983.
18. R. P. Stanley. Enumerative Combinatorics, vol. 1. Wadsworth and Brooks/Cole, Pacific Grove, CA, 1986.
19. I. A. Volodin, V. E. Kuznetsov, and A. T. Fomenko. The problem of discriminating algorithmically the standard three-dimensional sphere. Russian Math. Surveys, 29:71-172, 1974.