A subexponential size triangulation of $\mathbb{R}{P}^n$

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 ${\mathbb{RP}}^n$ of size $e^{(\frac{1}{2}+o(1))\sqrt{n}\log n}$.

References in corpus (1)

• Equilibrium and equivariant triangulations of some small covers with minimum number of vertices