arXiv Analytics

Sign in

arXiv:2405.09429 [math.CO]AbstractReferencesReviewsResources

Generalizations of cyclic polytopes

Tibor Bisztriczky

Published 2024-05-15Version 1

A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is the class of neighbourly polytopes. Cyclic polytopes have explicit facet structures, important properties and applications in different branches of mathematics. In the past few decades, generalizations of their combinatorial properties have yielded new classes of polytopes that also have explicit facet structures and useful applications. We present an overview of these generalizations along with some applications of the resultant polytopes, and some possible approaches to other generalizations.

Related articles: Most relevant | Search more
arXiv:1108.2871 [math.CO] (Published 2011-08-14, updated 2012-04-23)
A bound for the number of vertices of a polytope with applications
arXiv:math/0602362 [math.CO] (Published 2006-02-16, updated 2007-04-28)
The BG-rank of a partition and its applications
arXiv:0805.2773 [math.CO] (Published 2008-05-19)
Applications of Klee's Dehn-Sommerville relations