arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.03038math.AT
收藏

更高对称拓扑复杂性的单纯和组合形式

Simplicial and combinatorial versions of higher symmetric topological complexity

Amit Kumar Paul, Debasis Sen

摘要:

本文引入了单纯复形$K$的高对称单纯复杂性$SC_n^Σ(K)$和有限偏序集$P$的高对称组合复杂性$CC_n^Σ(P)$.这些是Basabe - González - Rudyak - Tamaki对称运动规划的简单和组合方法。证明了对称单纯复杂性$SC_n^Σ(K)$等于$K$的几何实现的对称拓扑复杂性$TC_n^Σ(|K|)$,对称组合复杂性$CC_n^Σ(P)$等于$P$的序复形的几何实现的对称拓扑复杂性$TC_n^Σ(|\mathcal{K}(P)|)$.

英文摘要:

In this paper, we introduce higher symmetric simplicial complexity $SC_n^Σ(K)$ of a simplicial complex $K$ and higher symmetric combinatorial complexity $CC_n^Σ(P)$ of a finite poset $P$. These are simplicial and combinatorial approaches to symmetric motion planning of Basabe - González - Rudyak - Tamaki. We prove that the symmetric simplicial complexity $SC_n^Σ(K)$ is equal to symmetric topological complexity $TC_n^Σ(|K|)$ of the geometric realization of $K$ and the symmetric combinatorial complexity $CC_n^Σ(P)$ is equal to symmetric topological complexity $TC_n^Σ(|\mathcal{K}(P)|)$ of the geometric realization of the order complex of $P$.

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

↑