×

A proof of Kühnel’s conjecture for \(n\geq k^ 2+3k\). (English) Zbl 0887.52007

The Kühnel’s conjecture for combinatorial 2k-manifolds has been established by W. Kühnel and U. Brehm if the number \(n\) of vertices of M satisfies either \(n \leq 3k + 3\) or \(n \geq k^2 + 4k + 3\). In this paper, the author improves this result by showing that the conjecture is true for \(n \geq k^2 + 3 k\) and so he obtains as a corollary that the statement in the conjecture is true for \(k = 1\) and \(k = 2\).

MSC:

52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
57Q15 Triangulating manifolds
Full Text: DOI

References:

[1] A. Björner and G. Kalai, On f-vectors and homology, Combinatorial Mathematics (G. J. Bloom et al., eds.), Proc. New York Acad. Sci. 555, 63–80 (1989) · Zbl 0747.52001
[2] U. Brehm and W. Kühnel, Combinatorial manifolds with few vertices, Topology 26, 465–473 (1987) · Zbl 0681.57009 · doi:10.1016/0040-9383(87)90042-5
[3] J. Eells and N. H. Kuiper, Manifolds which are like projective planes, Publ. Math. I.H.E.S. 14, 181–222(1962) · Zbl 0109.15701 · doi:10.1007/BF02684323
[4] B. Grünbaum, Convex Polytopes, Interscience Publishers, New York 1967 · Zbl 0163.16603
[5] G. Kalai, Rigidity and the Lower Bound Theorem I, Invent. Math. 88, 125–151 (1987) · Zbl 0624.52004 · doi:10.1007/BF01405094
[6] V. Klee, The number of vertices of a convex polytope, Can. J. Math. 16, 701–720 (1964) · Zbl 0128.17201 · doi:10.4153/CJM-1964-067-6
[7] W. Kühnel, Manifolds in the skeletons of convex polytopes, tightness, and generalized Heawood inequalities, Polytopes: Abstract, Convex and Computational (T. Bisztriczky et al., eds.), 241–247, World Scientific, Singapore 1994 · Zbl 0811.52006
[8] W. Kühnel, Tight Polyhedral Submanifolds and Tight Triangulations, Springer Lecture Notes in Mathematics 1612, Berlin - Heidelberg - New York 1995 · Zbl 0834.53004
[9] N. H. Kuiper, A short history of triangulation and related matters, Proc. bicenten. Congr. Wiskd. Genoot., Part I, Amsterdam 1978, Math. Cent. Tracts 100, 61–79 (1979)
[10] P. McMullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture, London Mathematical Society Lecture Notes Series 3, Cambridge University Press 1971 · Zbl 0217.46702
[11] R. Riordan, Combinatorial Identities, Wiley and Sons, New York 1968 · Zbl 0194.00502
[12] R. Stanley, The upper bound conjecture and Cohen-Macaulay-rings, Studies in Applied Math. 54, 135–142 (1975) · Zbl 0308.52009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.