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

等变拓扑复杂度

Equivariant topological complexities

Mark Grant

AI总结:

本文综述了考虑对称性的多种拓扑复杂度变体的主要定义及相关概念,介绍了其数学建模基础,并列出了待解决的开放问题。

摘要:

许多机械系统的构型空间都具有对称性。在数学上,这类对称性通过群在拓扑空间上的作用来建模。目前已出现多种考虑对称性的拓扑复杂度变体,要么要求运动规划器自身具备相容的对称性,要么利用对称性在功能等价的构型之间进行运动规划。我们将综述由Colman-Grant、Lubawski-Marzantowicz、Błaszczyk-Kaluba和Dranishnikov提出的主要定义,以及一些相关概念。最后我们列出了少量待解决的问题。

英文摘要:

Many mechanical systems have configuration spaces that admit symmetries. Mathematically, such symmetries are modelled by the action of a group on a topological space. Several variations of topological complexity have emerged that take symmetry into account in various ways, either by asking that the motion planners themselves admit compatible symmetries, or by exploiting the symmetry to motion plan between functionally equivalent configurations. We will survey the main definitions due to Colman-Grant, Lubawski-Marzantowicz, Błaszczyk-Kaluba and Dranishnikov, and some related notions. We conclude with a short list of open problems.

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

↑