English

An Efficient Triangulation of $\mathbb{R}P^5$

Combinatorics 2026-03-10 v1 Geometric Topology

Abstract

We present a 66-dimensional centrally symmetric simplicial polytope for which the antipodal quotient of its boundary forms a 2424-vertex triangulation of the 55-dimensional real projective space. This 66-polytope is highly symmetric with an automorphism group of order 192192, and is of independent interest. We conjecture that our construction uses the fewest number of vertices among all triangulations of RP5\mathbb{R}P^5. Our method also produces two triangulations of RP6\mathbb{R}P^6 on 4545 and 4949 vertices; both improve the previously best known construction in dimension 66 that used 5353 vertices.

Keywords

Cite

@article{arxiv.2603.07808,
  title  = {An Efficient Triangulation of $\mathbb{R}P^5$},
  author = {Dan Guyer and Stefan Steinerberger and Yirong Yang},
  journal= {arXiv preprint arXiv:2603.07808},
  year   = {2026}
}

Comments

10 pages, 3 figures

R2 v1 2026-07-01T11:09:25.903Z