6
$\begingroup$

For a convex polytope $P$ in $\mathbb R^4$, denote by $N_0,N_1,N_2,N_3$ respectively the number of vertices, edges, faces, cells. By Euler's formula, we know $N_0+N_2=N_1+N_3$, which means there is a sort of equilibrum among the $N_i$. But I wonder if there exist upper and/or lower bounds for $f(P):=\frac{N_1+N_2}{N_0+N_3}$ where $P\subset\mathbb R^4$ is any convex polytope.

E.g. for the regular one called 24-cell, we have $f(P)=4$.

$\endgroup$

2 Answers 2

7
$\begingroup$

As of 2003, I don't think it was known whether $f(P)$ is bounded. See Fat 4-polytopes and fatter 3-spheres by Eppstein, Kuperberg, and Ziegler (Monogr. Textbooks Pure Appl. Math. 253 (2003), 239-265, doi:10.1201/9780203911211, arxiv:math/0204007), which contains a beautiful construction that achieves $f(P)>5.048$, and shows that it is not bounded for strongly regular CW decompositions of the 3-sphere (instead of polytopes). I don't know whether there has been more recent progress.

$\endgroup$
3
3
$\begingroup$

Each cell is a convex polytope in 3-space and so has at least 4 faces, whereas each face should have only 2 cells, or $N_3\geq 2N_4$. The same argument for the dual polytope gives $N_1\geq 2N_0$, which gives a lower bound of $f\geq 2$, attained by the $5$-simplex.

This is analogous to the polyhedral bound of $2E \geq 3F,3V$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.