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

高拓扑复杂性空间

Spaces with high topological complexity

Aleksandra Franc, Petar Pavešić

摘要:

根据Farber的公式,一个(p-1)-连通的m维CW-复形X的拓扑复杂度TC(X)上界为(2 m +1)/p+1。对于TC(X)也有各种较低的估计,如环$H^*(X\times X,Δ(X))$的幂零性,以及弱而稳定的拓扑紧性wTC(X)和$σ\TC(X)$ .通常,这些上界和下界之间的差可以任意大。本文研究了拓扑复杂度接近Farber公式给出的最大值的空间,并证明了在这种情况下,上界之间的距离很窄,TC(X)常常与下界重合.

英文摘要:

By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times X,Δ(X))$, and the weak and stable topological compexity wTC(X) and $σ\TC(X)$. In general the difference between these upper and lower bounds can be arbitrarily large. In this paper we investigate spaces whose topological complexity is close to the maximal value given by Farber's formula and show that in these cases the gap between the lower and upper bounds is narrow and that TC(X) often coincides with the lower bounds.

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

↑