scientific article; zbMATH DE number 2068109
The {fatness} parameter of a \(4\)-dimensional convex polytope (or a finite CW decomposition of the \(3\)-sphere) \(P\) is defined as \(\phi(P) := {(f_{1}+f_{2})\slash (f_{0}+f_{3})}\), where \((f_{0},f_{1},f_{2},f_{3})\) is the face-vector of \(P\). The authors obtain lower bounds for the fatness of \(4\)-polytopes and CW \(3\)-spheres. They prove that there are convex \(4\)-polytopes \(P\) with \(\phi(P) > 5.048\); in particular they construct an infinite family of \(2\)-simplicial, \(2\)-simple \(4\)-polytopes with this property. Moreover, they show that fatness is not bounded for strongly regular CW decompositions of the \(3\)-sphere. For the entire collection see [Zbl 1034.52002].
- On the union of fat tetrahedra in three dimensions
- scientific article; zbMATH DE number 1789919
- Shelling polyhedral 3-balls and 4-polytopes
- 4-dimensional Archimedean polytopes
- The extended f-vectors of 4-polytopes
- Four-dimensional Archimedean polytopes
- Small f-vectors of 3-spheres and of 4-polytopes
- scientific article; zbMATH DE number 7499154
- scientific article; zbMATH DE number 665700
- scientific article; zbMATH DE number 4071795
- Symmetric matroid polytopes and their generation
- New cases of Reay's conjecture on partitions of points into simplices with \(k\)-dimensional intersection
- Shelling polyhedral 3-balls and 4-polytopes
- Semidefinite programming bounds for the average kissing number
- Characterizing face and flag vector pairs for polytopes
- Treetopes and their graphs
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- Contact graphs of ball packings
- Scribability problems for polytopes
- \(f\)-vectors of 3-polytopes symmetric under rotations and rotary reflections
- Apollonian ball packings and stacked polytopes
- Small f-vectors of 3-spheres and of 4-polytopes
- scientific article; zbMATH DE number 7499154 (Why is no real title available?)
- scientific article; zbMATH DE number 1789919 (Why is no real title available?)
- Projected products of polygons
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- The merging operation and \((d-i)\)-simplicial \(i\)-simple \(d\)-polytopes
- A polytopal generalization of Apollonian packings and Descartes' theorem
- Many triangulated 3-spheres
- New polytopes from products
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464720)