判别变体拓扑复杂度的上界

IF 0.8 4区数学 Q2 MATHEMATICS

Homology Homotopy and Applications Pub Date : 2020-10-19 DOI:10.4310/hha.2022.v24.n1.a9

Andrea Bianchi

引用次数: 0

摘要

我们给出了在多项式零轨迹的$\mathbb｛C｝^m$中作为补码获得的变种$\mathcal｛V｝$的拓扑复杂性的上界。作为一个应用，我们确定了平面无序配置空间的拓扑复杂性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An upper bound on the topological complexity of discriminantal varieties

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Homology Homotopy and Applications 数学-数学

CiteScore

1.10

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Homology, Homotopy and Applications is a refereed journal which publishes high-quality papers in the general area of homotopy theory and algebraic topology, as well as applications of the ideas and results in this area. This means applications in the broadest possible sense, i.e. applications to other parts of mathematics such as number theory and algebraic geometry, as well as to areas outside of mathematics, such as computer science, physics, and statistics. Homotopy theory is also intended to be interpreted broadly, including algebraic K-theory, model categories, homotopy theory of varieties, etc. We particularly encourage innovative papers which point the way toward new applications of the subject.