Upper bound theorem

In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given dimension and number of vertices. It is one of the central results of polyhedral combinatorics.

Originally known as the upper bound conjecture, this statement was formulated by Theodore Motzkin, proved in 1970 by Peter McMullen,[1] and strengthened from polytopes to subdivisions of a sphere in 1975 by Richard P. Stanley.

Cyclic polytopes

The cyclic polytope Δ(n,d) may be defined as the convex hull of n vertices on the moment curve (t, t², t³, ...). The precise choice of which n points on this curve are selected is irrelevant for the combinatorial structure of this polytope. The number of i-dimensional faces of Δ(n,d) is given by the formula

f_{i}(\Delta (n,d))={\binom {n}{i+1}}\quad {\textrm {for}}\quad 0\leq i<\left\lfloor {\frac {d}{2}}\right\rfloor

and $(f_{0},\ldots ,f_{\left\lfloor {\frac {d}{2}}\right\rfloor -1})$ completely determine $(f_{\left\lfloor {\frac {d}{2}}\right\rfloor },\ldots ,f_{d-1})$ via the Dehn–Sommerville equations. The same formula for the number of faces holds more generally for any neighborly polytope.

Statement

The upper bound theorem states that if Δ is a simplicial sphere of dimension d − 1 with n vertices, then

f_{i}(\Delta )\leq f_{i}(\Delta (n,d))\quad {\textrm {for}}\quad i=0,1,\ldots ,d-1.

That is, the number of faces of an arbitrary polytope can never be more than the number of faces of a cyclic or neighborly polytope with the same dimension and number of vertices. Asymptotically, this implies that there are at most $\scriptstyle O(n^{\lfloor d/2\rfloor })$ faces of all dimensions. The same bounds hold as well for convex polytopes that are not simplicial, as perturbing the vertices of such a polytope (and taking the convex hull of the perturbed vertices) can only increase the number of faces.

History

The upper bound conjecture for simplicial polytopes was proposed by Motzkin in 1957 and proved by McMullen in 1970. A key ingredient in his proof was the following reformulation in terms of h-vectors:

h_{i}(\Delta )\leq {\tbinom {n-d+i-1}{i}}\quad {\textrm {for}}\quad 0\leq i<\left\lfloor {\frac {d}{2}}\right\rfloor .

Victor Klee suggested that the same statement should hold for all simplicial spheres and this was indeed established in 1975 by Stanley [2] using the notion of a Stanley–Reisner ring and homological methods. For a nice historical account of this theorem see.[3]

References

Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, 152, Springer, p. 254, ISBN 9780387943657, Finally, in 1970 McMullen gave a complete proof of the upper-bound conjecture – since then it has been known as the upper bound theorem. McMullen's proof is amazingly simple and elegant, combining two key tools: shellability and h-vectors.
Stanley, Richard (1996). Combinatorics and commutative algebra. Boston, MA: Birkhäuser Boston, Inc. p. 164. ISBN 0-8176-3836-9.
Stanley, Richard (2014). "How the Upper Bound Conjecture Was Proved". Annals of Combinatorics. 18. pp. 533–539.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, 152, Springer, p. 254, ISBN 9780387943657, Finally, in 1970 McMullen gave a complete proof of the upper-bound conjecture – since then it has been known as the upper bound theorem. McMullen's proof is amazingly simple and elegant, combining two key tools: shellability and h-vectors.

[2] Stanley, Richard (1996). Combinatorics and commutative algebra. Boston, MA: Birkhäuser Boston, Inc. p. 164. ISBN 0-8176-3836-9.

[3] Stanley, Richard (2014). "How the Upper Bound Conjecture Was Proved". Annals of Combinatorics. 18. pp. 533–539.