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

A Finite Equivariant Generalization of Motion Planning and Topological Complexity

Rebecca Bell, Allison N. Eckert, Ryan M. Pesak, Avery Schweitzer

英文摘要:

This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this invariant and several others already discussed in the literature: Farber's topological complexity, Tanaka's combinatorial complexity, and Colman-Grant's equivariant Lusternik-Schnirelmann category. We find bounds for equivariant combinatorial complexity and for the necessary lengths of equivariant combinatorial motion plannings. We show that the equivariant topological complexity of any finite $G$-space is equal to its equivariant combinatorial complexity. We then adapt Gonzàlez's simplicial complexity to ordered and unordered $G$-simplicial complexes and explore its first properties. Lastly, we show that the equivariant topological complexity of the realization of any ordered $G$-simplicial complex is equal to the equivariant simplicial complexity.

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

↑