Face numbers of 4-Polytopes and 3-Spheres
G\"unter M. Ziegler

TL;DR
This paper explores the properties of 4-polytopes and 3-spheres using new parameters called fatness and complexity, aiming to distinguish different classes and develop construction methods for highly 'fat' polytopes.
Contribution
It introduces the parameters fatness and complexity for 4-polytopes and 3-spheres, and presents new constructions of polytopes with arbitrarily large fatness.
Findings
Existence of 3-spheres with arbitrarily large fatness
Convex 4-polytopes with fatness > 5.048
Rational convex 4-polytopes with fatness > 5-epsilon
Abstract
In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many more edges and 2-faces than there are vertices and facets, while complexity C(P) := (f_{03}-20)/(f_0+f_3-10) is large if every facet has many vertices, and every vertex is in many facets. Recent results suggest that these parameters might allow one to differentiate between the cones of f- or flag-vectors of -- connected Eulerian lattices of length 5 (combinatorial objects), -- strongly regular CW 3-spheres (topological objects), -- convex 4-polytopes (discrete geometric objects), and -- rational convex 4-polytopes (whose study involves arithmetic aspects). Further progress will depend on the derivation of tighter f-vector inequalities for convex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
