A subexponential size triangulation of $\mathbb{R}P^n$
Combinatorics
2021-08-26 v2 Geometric Topology
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 of size .
Cite
@article{arxiv.2009.02703,
title = {A subexponential size triangulation of $\mathbb{R}P^n$},
author = {Karim Adiprasito and Sergey Avvakumov and Roman Karasev},
journal= {arXiv preprint arXiv:2009.02703},
year = {2021}
}