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.
Research was supported by the Alexander von Humboldt Stiftung and by the Fund for the Promotion of Research at the Technion.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L.J. Billera and J.S. Provan. Decomposition of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res. 5 (1980) 576–594.
A. Björner. Homology and shellability of matroids and geometric lattices, in: N. White, ed., Matroid Applications, 226-283. Cambridge University Press, 1992.
A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G.M. Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1993.
A. Björner and M. Wachs. On lexicographically shellable posets. Trans. Amer. Math. Soc. 277 (1983) 323–341
G. Danaraj and V. Klee. Which spheres are shellable? Annals of Discrete Mathematics 2 (1978) 33–52
M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman, San Francisco, Cal., 1979.
W. Hochstättler. Shellability of Oriented Matroids, in: Proc. 1st Symp. Integer Progr. Combin. Optim. (IPCO) (1990) 275–281
P. Kleinschmidt and S. Onn. Partitionable simplicial complexes and signable posets. Submitted.
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.
M. Las Vergnas. Convexity in oriented matroids. J. Combin. Theory Ser. B 29 (1980) 231–243
P. Mani-Levitska. Convex polytopes and smooth structures on manifolds. Euro-conference on Combinatorial Geometry, Crete, July 1994.
P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika 17 (1970) 179–184
S. Onn. On the geometry and computational complexity of Radon partitions in the integer lattice. SIAM J. Discr. Math. 4 (1991) 436–447.
S. Onn. Partitionable posets and their chain complexes and flag vectors. Submitted.
R. Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face, in: Proc. 18th Ann. ACM Symp. Theory Comput. (1986) 404–413
R.P. Stanley. Enumerative Combinatorics, Vol. 1. Wadsworth and Brooks/Cole, Pacific Grove, CA, 1986.
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–172
G.M. Ziegler. Lectures on Polytopes. Cambridge University Press, Cambridge, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kleinschmidt, P., Onn, S. (1995). Oriented matroid polytopes and polyhedral fans are signable. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_52
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive