Cyclic polytope

The moment curve in ${\displaystyle \mathbb {R} ^{d}}$ is defined by

${\displaystyle \mathbf {x}$ :\mathbb {R} \rightarrow \mathbb {R} ^{d},\mathbf {x} (t):={\begin{bmatrix}t,t^{2},\ldots ,t^{d}\end{bmatrix}}^{T}} .[1]

The ${\displaystyle d}$-dimensional cyclic polytope with ${\displaystyle n}$ vertices is the convex hull

${\displaystyle C(n,d):=\mathbf {conv} \{\mathbf {x} (t_{1}),\mathbf {x} (t_{2}),\ldots ,\mathbf {x} (t_{n})\}}$

of ${\displaystyle n>d\geq 2}$ distinct points ${\displaystyle \mathbf {x} (t_{i})}$ with ${\displaystyle t_{1}<t_{2}<\ldots <t_{n}}$ on the moment curve.[1]

The combinatorial structure of this polytope is independent of the points chosen, and the resulting polytope has dimension d and n vertices.[1] Its boundary is a (d − 1)-dimensional simplicial polytope denoted Δ(n,d).

The Gale evenness condition[2] provides a necessary and sufficient condition to determine a facet on a cyclic polytope.

Let ${\displaystyle T:=\{t_{1},t_{2},\ldots ,t_{n}\}}$. Then, a ${\displaystyle d}$-subset ${\displaystyle T_{d}\subseteq T}$ forms a facet of ${\displaystyle C(n,d)}$ iff any two elements in ${\displaystyle T\setminus T_{d}}$ are separated by an even number of elements from ${\displaystyle T_{d}}$ in the sequence ${\displaystyle (t_{1},t_{2},\ldots ,t_{n})}$.

Cyclic polytopes are examples of neighborly polytopes, in that every set of at most d/2 vertices forms a face. They were the first neighborly polytopes known, and Theodore Motzkin conjectured that all neighborly polytopes are combinatorially equivalent to cyclic polytopes, but this is now known to be false.[3][4]

The number of i-dimensional faces of the cyclic polytope Δ(n,d) is given by the formula

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

and ${\displaystyle (f_{0},\ldots ,f_{\left\lfloor {\frac {d}{2}}\right\rfloor -1})}$ completely determine ${\displaystyle (f_{\left\lfloor {\frac {d}{2}}\right\rfloor },\ldots ,f_{d-1})}$ via the Dehn–Sommerville equations.

The upper bound theorem states that cyclic polytopes have the maximum possible number of faces for a given dimension and number of vertices: if Δ is a simplicial sphere of dimension d − 1 with n vertices, then

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

The upper bound conjecture for simplicial polytopes was proposed by Theodore Motzkin in 1957 and proved by Peter McMullen in 1970. Victor Klee suggested that the same statement should hold for all simplicial spheres and this was indeed established in 1975 by Richard P. Stanley[5] using the notion of a Stanley–Reisner ring and homological methods.

• Combinatorial commutative algebra