Cyclic polytope
id:
cyclic-polytope-196-5009294
title:
Cyclic polytope
text:
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. They play an important role in polyhedral combinatorics: according to the upper bound theorem, proved by Peter McMullen and Richard Stanley, the boundary Δ(n,d) of the cyclic polytope C(n,d) maximizes the numb
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Cyclic_polytope
date created:
date modified:
2024-01-16T21:00:55Z
main entity:
{"identifier":"Q245469","url":"https://www.wikidata.org/entity/Q245469"}
image:
fields total:
13
integrity:
13