arXiv · 2411.00497
Topological complexity of enumerative problems and classifying spaces of $PU_n$
Abstract
We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we prove lower bounds for the topological complexity of any algorithm that finds solutions to the three problems and for the Schwarz genera of their associated covers. The key is to understand cohomology classes of the classifying spaces of projective unitary groups $PU_n$.
Explore related subjects
Keep this discovery
Weiyan Chen, Xing Gu. 2024-11-01. Topological complexity of enumerative problems and classifying spaces of $PU_n$. https://arxiv.org/abs/2411.00497
Cite the original work for its findings. Save a collection to share your selection of sources.