A subexponential size triangulation of ℝPⁿ

2020/09/06 by Karim Adiprasito, Adiprasito, Karim, Sergey Avvakumov +3
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Geometric Topology (math.GT) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2009.02703

openalex publication_date 2020/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We address a long-standing and long-investigated problem in combinatorial topology, and break the exponential barrier for triangulations of real projective space, constructing a trianglation of \mathbbRPⁿ of size e^((1)/(2)+o(1))√(n)log n.

Related

• Triangulations of \mathbbRPⁿ with few vertices
• A new family of triangulations of ℝP^d
• The number of regular simplices in higher dimensions
• A Quantitative Steinitz Theorem for Plane Triangulations
• On \ZZ₂ⁿ-equivariant triangulation of \RR Pⁿ