arXiv (All)
open access
The minimum number of vertices of a triangulation of $\mathbb{RP}^5$
We give a computer-assisted proof that every finite simplicial triangulation of real projective five-space has at least twenty-four vertices. Together with the construction of Guyer, Steinerberger, and Yang, this determines the minimum. A cup-product argument produces an induced subcomplex on sixtee
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Multilayered PCPs and Hypergraph Vertex Cover#974864
- Vertex Classification of Planar C-polygons#183127
- Vertex Classification of Planar C-polygons#183077
- Vertex Classification of Planar C-polygons#183027
- Vertex Classification of Planar C-polygons#182977
Record · ID 1400004
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive