arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0171math.ATmath.GT
收藏

等变拓扑复杂性的一种新方法

A new approach to the equivariant topological complexity

Wojciech Lubawski, Wacław Marzantowicz

摘要:

我们提出了一种新的方法来等变版本的拓扑复杂性,称为对称拓扑复杂性。看来,所提出的方法是更充分的分析的影响,对称性的运动规划算法比一个介绍和研究的Colman和格兰特。我们展示了许多界限的对称拓扑复杂性比较它与已知的不变量,并证明,在自由行动的情况下,它等于法伯的轨道空间的拓扑复杂性。我们定义它的怀特黑德版本。

英文摘要:

We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion planning algoritm than the one introduced and studied by Colman and Grant. We show many bounds for the symmetric topological complexity comparing it with already known invariants and prove that in the case of a free action it is equal to the Farber's topological complexity of the orbit space. We define the Whitehead version of it.

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

↑