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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.