On a vertex-minimal triangulation of $\mathbb{R}P^4$
Sonia Balagopalan

TL;DR
This paper presents three constructions of a vertex-minimal triangulation of 4-dimensional real projective space, improving understanding of minimal triangulations and related combinatorial structures.
Contribution
It introduces three new constructions of a minimal triangulation of real projective space, including a symmetric 32-vertex sphere and approaches to reduce vertex count.
Findings
Constructed a 32-vertex triangulation with high symmetry
Provided methods to improve vertex bounds for space triangulations
Connected the triangulation to the 22-point Witt design
Abstract
We give three constructions of a vertex-minimal triangulation of -dimensional real projective space . The first construction describes a -dimensional sphere on vertices, which is a double cover of a triangulated and has a large amount of symmetry. The second and third constructions illustrate approaches to improving the known number of vertices needed to triangulate -dimensional real projective space. All three constructions deliver the same combinatorial manifold, which is also the same as the only known -vertex triangulation of . We also give a short, simple construction of the -point Witt design, which is closely related to the complex we construct.
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
TopicsAdvanced Combinatorial Mathematics · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis
