arXiv Analytics

Sign in

arXiv:2010.09615 [math.AT]AbstractReferencesReviewsResources

An upper bound on the topological complexity of discriminantal varieties

Andrea Bianchi

Published 2020-10-19Version 1

We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered configuration spaces of the plane.

Comments: 15 pages
Categories: math.AT
Subjects: 55M30, 55R80, 14L30
Related articles: Most relevant | Search more
arXiv:1807.03994 [math.AT] (Published 2018-07-11)
An upper bound for topological complexity
arXiv:2411.00497 [math.AT] (Published 2024-11-01)
Topological complexity of enumerative problems and classifying spaces of $PU_n$
arXiv:1712.07068 [math.AT] (Published 2017-12-19)
Topological complexity of unordered configuration spaces of surfaces

Links

Toolbox