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.
随便看	honey dippers的意思 honey do list的意思 Honeydripper的意思 Honey drizzler的意思 honey drizzlers的意思 honeydude的意思 honeyeater的意思 Honey Eater的意思 honeyeater的意思 honey eaters的意思 honeyed的意思 honeyed bolus的意思 honeyed kumquat candied fruit的意思 honeyedly的意思 honeyed pill的意思 honeyed words的意思 honeyed words的意思 Honey extractor的意思 honey extractors的意思 honey feeding的意思 honey filter的意思 honeyflow的意思 Honey flow的意思 Honeyflower的意思 honeyflowers的意思