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, and strengthened from polytopes to subdivisions of a sphere in 1975 by Richard P. Stanley.

单词	Upper bound theorem
释义	Upper bound theorem 英语百科 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, and strengthened from polytopes to subdivisions of a sphere in 1975 by Richard P. Stanley.
随便看	standar error of quantiles standarization standarized component standarized senna fruit extract standarizing pump stand around standars Gibbs function increase stand as stand a show stand a show of stand aside stand astraddle stand astride stand at stand at a nonplus stand at attention stand at bay Stand at Ease stand at gaze stand atgaze stand at parity stand at salute stand at the courtesy of stand at the crossroad standaway