A Subexponential Size Triangulation of ℝPn

We break the exponential barrier for triangulations of the real projective space, constructing a trianglation of ℝ P n with e ( 1 2 + o ( 1 ) ) n log n vertices.

Saved in:
Bibliographic Details
Published inCombinatorica (Budapest. 1981) Vol. 42; no. 1; pp. 1 - 8
Main Authors Adiprasito, Karim, Avvakumov, Sergey, Karasev, Roman
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 2022
Springer Nature B.V
Subjects
Apexes
Combinatorics
Mathematics
Mathematics and Statistics
Original Paper
Triangulation
57Q15
Online AccessGet full text

Cover

More Information
Summary:We break the exponential barrier for triangulations of the real projective space, constructing a trianglation of ℝ P n with e ( 1 2 + o ( 1 ) ) n log n vertices.
ISSN:0209-9683
1439-6912
DOI:10.1007/s00493-021-4602-x