Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the growth of topological complexity

Published 20 May 2020 in math.AT | (2005.09847v4)

Abstract: Let $\mathrm{TC}r(X)$ denote the $r$-th topological complexity of a space $X$. In many cases, the generating function $\sum{r\ge 1}\mathrm{TC}_{r+1}(X)xr$ is a rational function $\frac{P(x)}{(1-x)2}$ where $P(x)$ is a polynomial with $P(1)=\mathrm{cat}(X)$, that is, the asymptotic growth of $\mathrm{TC}_r(X)$ with respect to $r$ is $\mathrm{cat}(X)$. In this paper, we introduce a lower bound $\mathrm{MTC}_r(X)$ of $\mathrm{TC}_r(X)$ for a rational space $X$, and estimate the growth of $\mathrm{MTC}_r(X)$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.