An upper bound on the topological complexity of discriminantal varieties

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Dokumenter

  • Fulltext

    Indsendt manuskript, 221 KB, PDF-dokument

We give an upper bound on the topological complexity of varieties V obtained as complements in Cm of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered configuration spaces of the plane.

OriginalsprogEngelsk
TidsskriftHomology, Homotopy and Applications
Vol/bind24
Udgave nummer1
Sider (fra-til)161-176
Antal sider16
ISSN1532-0073
DOI
StatusUdgivet - 2022

Bibliografisk note

Funding Information:
The author was partially supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC-2047/1, 390685813), and by the Danish National Research Foundation through the Centre for Geometry and Topology (DNRF151) and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 772960). Received March 9, 2021; published on April 6, 2022. 2010 Mathematics Subject Classification: 55M30, 55R80, 14L30. Key words and phrases: topological complexity, configuration space, affine variety, equivariant topological complexity. Article available at http://dx.doi.org/10.4310/HHA.2022.v24.n1.a9 Copyright © 2022, Andrea Bianchi. Permission to copy for private use granted.

Funding Information:
Theorem 1.5 was first announced at the UMI-SIMAI-PTM joint meeting in September 2018, where I received some useful comments by Mark Grant and Paolo Salvatore, whom I thank. I would also like to thank David Recio-Mitter for many useful conversations about motion planners, and Mirko Mauri for pointing me to the Lefschetz hyperplane theorem. Finally, I would like to thank Peter Landweber and the anonymous referee for many useful remarks and small corrections on first versions of the article.

Publisher Copyright:
© 2022. Andrea Bianchi. Permission to copy for private use granted. All Rights Reserved.

ID: 343343820