Abstract
We give purely combinatorial proofs of the lower-bound theorems for pseudomanifolds with or without boundary.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
D. Barnette: The minimum number of vertices of a simple polytope,Israel J. Math. 10 (1971), 121–125.
D. Barnette: Graph theorems for manifolds,Israel. J. Mat. 16 (1973), 62–72.
A. Björner: The minimum number of faces of a simple polytope,European J. Combin. 1 (1980), 27–31.
M. Dehn: Über die Starrheit Knovexer Polyeder,Math. Ann. 77 (1916), 466–473.
A. Fogelsanger: The generic rigidity of minimal cycles, Ph.D. thesis, Cornell University, 1988.
M. Goresky and R. MacPherson: Intersection homology theory,Topology 19 (1980), 135–162.
M. Gromov,Partial Differential Relations, Springer-Verlag, Berlin, 1986.
G. Kalai: Rigidity and the lower bound theorem, I,Invent. Math. 88 (1987), 125–151.
Klee, V.: Ad-pseudomanifold withf 0 vertices has at leastdf 0-(d−1)(d+2)d-simplices,Houston J. Math. 1 (1975), 81–96.
J. R. Munkres:Elements of Algebraic Topology, Addison-Wesley, 1984.
R. P. Stanley,Interactions Between Commutative Algebra and Combinatorics, Birkhauser, Boston, 1983.
T. S. Tay, N. L. White, and W. Whiteley: Skeletal rigidity of simplicial complexes, Report No. 20, Institut Mittag-Leffler, 1992.
A. T. White:Graphs, Groups and Surfaces, North-Holland, Amsterdam, 1984.
W. Whiteley: Matroids and rigid structures, in N. White (ed.),Matroid Applications, Cambridge University Press, Cambridge, 1992, pp. 1–53.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tay, TS. Lower-bound theorems for pseudomanifolds. Discrete Comput Geom 13, 203–216 (1995). https://doi.org/10.1007/BF02574038
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574038