Oriented matroid polytopes and polyhedral fans are signable

  • Peter Kleinschmidt
  • Shmuel Onn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 920)

Abstract

While convex polytopes are well known to be shellable, an outstanding open question, of which the answer is likely to be negative, is whether the strictly larger classes of oriented matroid polytopes and polyhedral cone fans are also shellable. In this article we show in a unified way that both classes posses the somewhat weaker property of signability. In particular, this allows us to conclude that simplicial oriented matroid polytopes and fans are partitionable, and to prove they satisfy McMullen's upper bound theorem on the number of faces. We also discuss computational complexity aspects of signability and shellability, and pose questions regarding the hierarchy of signable and shellable complexes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L.J. Billera and J.S. Provan. Decomposition of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res. 5 (1980) 576–594.Google Scholar
  2. 2.
    A. Björner. Homology and shellability of matroids and geometric lattices, in: N. White, ed., Matroid Applications, 226-283. Cambridge University Press, 1992.Google Scholar
  3. 3.
    A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G.M. Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1993.Google Scholar
  4. 4.
    A. Björner and M. Wachs. On lexicographically shellable posets. Trans. Amer. Math. Soc. 277 (1983) 323–341Google Scholar
  5. 5.
    G. Danaraj and V. Klee. Which spheres are shellable? Annals of Discrete Mathematics 2 (1978) 33–52Google Scholar
  6. 6.
    M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman, San Francisco, Cal., 1979.Google Scholar
  7. 7.
    W. Hochstättler. Shellability of Oriented Matroids, in: Proc. 1st Symp. Integer Progr. Combin. Optim. (IPCO) (1990) 275–281Google Scholar
  8. 8.
    P. Kleinschmidt and S. Onn. Partitionable simplicial complexes and signable posets. Submitted.Google Scholar
  9. 9.
    P. Kleinschmidt and Z. Smilansky. New results for simplicial spherical polytopes, in: J. E. Goodman, R. Pollack, and W. Steiger, eds, DIMACS Ser. vol. 6: Special Year on Disc. Comp. Geom. 187–197. Amer. Math. Soc. 1991.Google Scholar
  10. 10.
    M. Las Vergnas. Convexity in oriented matroids. J. Combin. Theory Ser. B 29 (1980) 231–243Google Scholar
  11. 11.
    P. Mani-Levitska. Convex polytopes and smooth structures on manifolds. Euro-conference on Combinatorial Geometry, Crete, July 1994.Google Scholar
  12. 12.
    P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika 17 (1970) 179–184Google Scholar
  13. 13.
    S. Onn. On the geometry and computational complexity of Radon partitions in the integer lattice. SIAM J. Discr. Math. 4 (1991) 436–447.Google Scholar
  14. 14.
    S. Onn. Partitionable posets and their chain complexes and flag vectors. Submitted.Google Scholar
  15. 15.
    R. Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face, in: Proc. 18th Ann. ACM Symp. Theory Comput. (1986) 404–413Google Scholar
  16. 16.
    R.P. Stanley. Enumerative Combinatorics, Vol. 1. Wadsworth and Brooks/Cole, Pacific Grove, CA, 1986.Google Scholar
  17. 17.
    I.A. Volodin, V.E. Kuznetsov, and A.T. Fomenko. The problem of discriminating algorithmically the standard three-dimensional sphere. Russian Math. Surveys 29 (1974) 71–172Google Scholar
  18. 18.
    G.M. Ziegler. Lectures on Polytopes. Cambridge University Press, Cambridge, 1995.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Peter Kleinschmidt
    • 1
  • Shmuel Onn
    • 2
  1. 1.Wirtschaftswissenschaftliche Fakultät, Lehrstuhl für WirtschaftsinformatikUniversität PassauPassauGermany
  2. 2.Department of Operations ResearchSchool of Industrial Engineering and Management, TechnionHaifaIsrael

Personalised recommendations