Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tight Chiral Polytopes

Published 9 Sep 2020 in math.CO | (2009.04566v1)

Abstract: A chiral polytope with Schl\"{a}fli symbol ${p_1, \ldots, p_{n-1}}$ has at least $2p_1 \cdots p_{n-1}$ flags, and it is called \emph{tight} if the number of flags meets this lower bound. The Schl\"{a}fli symbols of tight chiral polyhedra were classified in an earlier paper, and another paper proved that there are no tight chiral $n$-polytopes with $n \geq 6$. Here we prove that there are no tight chiral $5$-polytopes, describe 11 families of tight chiral $4$-polytopes, and show that every tight chiral $4$-polytope covers a polytope from one of those families.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.