Abstract
We break the exponential barrier for triangulations of the real projective space, constructing a trianglation of ℝPn with \({e^{\left({{1 \over 2} + o(1)} \right)\sqrt n \log n}}\) vertices.
Similar content being viewed by others
References
K. Adiprasito: Combinatorial Lefschetz theorems beyond positivity, 2018, preprint, arXiv:1812.10454.
K. Adiprasito and G. Yashfe: The Partition Complex: an invitation to combinatorial commutative algebra, 2020, Surveys in Combinatorics, British Combinatorial Committee, arXiv:2008.01044.
P. Arnoux and A. Marin: The Kühnel triangulation of the complex projective plane from the view point of complex crystallography. II, Mem. Fac. Sci. Kyushu Univ. Ser. A 45 (1991), 167–244.
A. Barvinok: A bound for the number of vertices of a polytope with applications, Combinatorica 33 (2013), 1–10.
B. Basak and S. Sarkar: Equilibrium and equivariant triangulations of some small covers with minimum number of vertices., J. Ramanujan Math. Soc. 30 (2015), 29–50.
O. Cornea, G. Lupton, J. Oprea and D. Tanre: Lusternik-Schnirelmann category, Mathematical Surveys and Monographs, vol. 103, American Mathematical Society, Providence, RI, 2003.
B. Delaunay: Sur la sphère vide, in: Proceedings Congress Toronto 1, 695–700 1928.
P. Frankl, J. Pach and D. Pálvölgyi: Exchange properties of finite set-systems, 2021, preprint, arXiv:2103.14358.
W. Kuhnel: Tight Polyhedral Submanifolds and Tight Triangulations, Lecture Notes in Mathematics, vol. 1612, Springer-Verlag, Berlin, 1995.
F. H. Lutz: Triangulated manifolds with few vertices and vertex-transitive group actions, Berichte aus der Mathematik. [Reports from Mathematics], Verlag Shaker, Aachen, 1999, Dissertation, Technischen Universität Berlin, Berlin, 1999.
S. Murai: Tight combinatorial manifolds and graded Betti numbers., Collect. Math. 66 (2015), 367–386.
L. Venturello and H. Zheng: A new family of triangulations of ℝPd, Combinatorica 41 (2021), 127–146.
Acknowledgments
We wish to thank Wolfgang Kühnel and Alexis Marin for very extensive and helpful remarks on the first version of the paper and anonymous referees for their comments and their suggestion of how to simplify the last part of the proof of Claim 3.3. We also wish to thank Arseniy Akopyan, Xavier Goaoc, Andrey Kupavskii, Gaku Liu, János Pach and Dömötör Pálvölgyi for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Wolfgang Kühnel on the occasion of his 70th birthday.
Has received funding from the European Research Council under the European Unions Seventh Framework Programme ERC Grant agreement ERC StG 716424 — CASe and the Israel Science Founda-tion under ISF Grant 1050/16.
Has received funding from the European Research Council under the European Unions Seventh Framework Programme ERC Grant agreement ERC StG 716424 — CASe.
Supported by the Federal professorship program grant 1.456.2016/1.4 and the Russian Foundation for Basic Research grants 18-01-00036 and 19-01-00169.
Rights and permissions
About this article
Cite this article
Adiprasito, K., Avvakumov, S. & Karasev, R. A Subexponential Size Triangulation of ℝPn. Combinatorica 42, 1–8 (2022). https://doi.org/10.1007/s00493-021-4602-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-021-4602-x