论文标题
上界的拓扑复杂性，判别品种
An upper bound on the topological complexity of discriminantal varieties
论文作者
论文摘要
我们在$ \ mathbb {c}^m $中以$ \ mathbb {c}^m $的补充而获得的品种的拓扑复杂性$ \ mathcal {v} $给出了上限。作为应用程序，我们确定了平面无序配置空间的拓扑复杂性。
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.
