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

有理截范畴的计算

Computations in rational sectional category

J. G. Carrasquel-Vera

摘要:

给出了有理截范畴的简单上界,并利用它们计算了有理空间的Farber拓扑复杂性类型的不变量。特别是,我们证明了形式态射的截范畴达到了其上同调下界,并给出了一种根据形式空间的上同调来计算形式空间的更高拓扑复杂性的方法。

英文摘要:

We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches its cohomological lower bound and give a method to compute higher topological complexity of formal spaces in terms of their cohomology.

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

↑