Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tight orientably-regular polytopes

Published 4 Oct 2013 in math.CO | (1310.1417v1)

Abstract: Every equivelar abstract polytope of type ${p_1, \ldots, p_{n-1}}$ has at least $2p_1 \cdots p_{n-1}$ flags. Polytopes that attain this lower bound are called tight. Here we investigate the question of under what conditions there is a tight orientably-regular polytope of type ${p_1, \ldots, p_{n-1}}$. We show that it is necessary and sufficient that whenever $p_i$ is odd, both $p_{i-1}$ and $p_{i+1}$ are even divisors of $2p_i$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.