Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Install
Faster access than browser!
 

Upper bound theorem

Index 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. [1]

13 relations: Convex hull, Convex polytope, Cyclic polytope, Dehn–Sommerville equations, H-vector, Moment curve, Neighborly polytope, Peter McMullen, Polyhedral combinatorics, Richard P. Stanley, Stanley–Reisner ring, Theodore Motzkin, Vertex (geometry).

Convex hull

In mathematics, the convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X., p. 3.

New!!: Upper bound theorem and Convex hull · See more »

Convex polytope

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn.

New!!: Upper bound theorem and Convex polytope · See more »

Cyclic polytope

In mathematics, a cyclic polytope, denoted C(n,d), is a convex polytope formed as a convex hull of n distinct points on a rational normal curve in Rd, where n is greater than d. These polytopes were studied by Constantin Carathéodory, David Gale, Theodore Motzkin, Victor Klee, and others.

New!!: Upper bound theorem and Cyclic polytope · See more »

Dehn–Sommerville equations

In mathematics, the Dehn–Sommerville equations are a complete set of linear relations between the numbers of faces of different dimension of a simplicial polytope.

New!!: Upper bound theorem and Dehn–Sommerville equations · See more »

H-vector

In algebraic combinatorics, the h-vector of a simplicial polytope is a fundamental invariant of the polytope which encodes the number of faces of different dimensions and allows one to express the Dehn–Sommerville equations in a particularly simple form.

New!!: Upper bound theorem and H-vector · See more »

Moment curve

In geometry, the moment curve is an algebraic curve in d-dimensional Euclidean space given by the set of points with Cartesian coordinates of the form In the Euclidean plane, the moment curve is a parabola, and in three-dimensional space it is a twisted cubic.

New!!: Upper bound theorem and Moment curve · See more »

Neighborly polytope

In geometry and polyhedral combinatorics, a k-neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face.

New!!: Upper bound theorem and Neighborly polytope · See more »

Peter McMullen

Peter McMullen (born 11 May 1942) is a British mathematician, a professor emeritus of mathematics at University College London.

New!!: Upper bound theorem and Peter McMullen · See more »

Polyhedral combinatorics

Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.

New!!: Upper bound theorem and Polyhedral combinatorics · See more »

Richard P. Stanley

Richard Peter Stanley (born June 23, 1944 in New York City, New York) is the Norman Levinson Professor of Applied Mathematics at the Massachusetts Institute of Technology, in Cambridge, Massachusetts.

New!!: Upper bound theorem and Richard P. Stanley · See more »

Stanley–Reisner ring

In mathematics, a Stanley–Reisner ring is a quotient of a polynomial algebra over a field by a square-free monomial ideal.

New!!: Upper bound theorem and Stanley–Reisner ring · See more »

Theodore Motzkin

Theodore Samuel Motzkin (26 March 1908 – 15 December 1970) was an Israeli-American mathematician.

New!!: Upper bound theorem and Theodore Motzkin · See more »

Vertex (geometry)

In geometry, a vertex (plural: vertices or vertexes) is a point where two or more curves, lines, or edges meet.

New!!: Upper bound theorem and Vertex (geometry) · See more »

Redirects here:

Upper Bound Conjecture.

References

[1] https://en.wikipedia.org/wiki/Upper_bound_theorem

OutgoingIncoming
Hey! We are on Facebook now! »