Vertex-minimality conjecture for the triangulation of real projective 5-space from \mathcal{P}_{6,48}

From papers

Let P6,48\mathcal{P}_{6,48} be the centrally symmetric simplicial 66-polytope whose antipodal quotient of the boundary gives a triangulation of RP5\mathbb{R}P^5. A triangulation is vertex minimal if no triangulation of the same space has fewer vertices. Vertex-minimality conjecture. The triangulation of RP5\mathbb{R}P^5 obtained by antipodally identifying the boundary of P6,48\mathcal{P}_{6,48} is vertex minimal among all triangulations of RP5\mathbb{R}P^5. The construction has 2424 vertices, and the conjecture asserts that this is the fewest possible; at minimum, the authors expect minimality among triangulations arising from antipodally identifying a centrally symmetric polytope.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Dan Guyer, Stefan Steinerberger and Yirong Yang, “An Efficient Triangulation of RP^5”, arXiv:2603.07808 (2026).

Solutions 0

No solutions have been posted yet.