An Efficient Triangulation of $\mathbb{R}P^5$
Combinatorics
2026-03-10 v1 Geometric Topology
Abstract
We present a -dimensional centrally symmetric simplicial polytope for which the antipodal quotient of its boundary forms a -vertex triangulation of the -dimensional real projective space. This -polytope is highly symmetric with an automorphism group of order , and is of independent interest. We conjecture that our construction uses the fewest number of vertices among all triangulations of . Our method also produces two triangulations of on and vertices; both improve the previously best known construction in dimension that used 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