arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.18524math.AT
收藏

关于有效拓扑复杂度与有效Lusternik-Schnirelmann畴数的性质

On properties of effective topological complexity and effective Lusternik-Schnirelmann category

Zbigniew Błaszczyk, Arturo Espinosa Baro, Antonio Viruel

AI总结:

本文研究有效拓扑复杂度的性质,引入有效LS-畴数概念,探究其与群作用轨道映射的关系并给出示例,还提出基于饱和对角线上同调维数界的非消失准则。

摘要:

由Błaszczyk和Kaluba提出的有效拓扑复杂度概念,研究在构型空间中利用群作用来降低运动规划算法的复杂度。本文聚焦于研究该拓扑复杂度概念的若干性质。我们引入了有效LS-畴数的概念,它模拟了通常的LS-畴数在非有效情形下的特性。我们利用它来探究这些有效不变量与群作用下轨道映射之间的关系,并给出了大量示例。此外,我们还研究了基于饱和对角线的上同调维数界的非消失准则。

英文摘要:

The notion of effective topological complexity, introduced by Błaszczyk and Kaluba, deals with using group actions in the configuration space in order to reduce the complexity of the motion planning algorithm. In this article we focus on studying several properties of such notion of topological complexity. We introduce a notion of effective LS-category which mimics the behaviour the usual LS-cat has in the non-effective setting. We use it to investigate the relationship between these effective invariants and the orbit map with respect of the group action, and we give numerous examples. Additionally, we investigate non-vanishing criteria based on a cohomological dimension bound of the saturated diagonal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑