An upper bound on the topological complexity of discriminantal varieties

Abstract

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.

15 pages