An upper bound for topological complexity
Michael Farber, Mark Grant, Gregory Lupton, John Oprea

TL;DR
This paper investigates a new invariant called $ ext{TC}^ ext{D}$ for topological complexity, explores its properties and connections to Lusternik-Schnirelmann invariants, and introduces an upper bound for $ ext{TC}$ based on this invariant.
Contribution
It introduces a new $ ext{TC}$-type invariant $ ilde{ ext{TC}}$ and establishes an upper bound for $ ext{TC}$ using $ ext{TC}^ ext{D}$, refining previous estimates.
Findings
Defined and analyzed properties of $ ext{TC}^ ext{D}$.
Established a new upper bound for $ ext{TC}$ involving $ ext{TC}^ ext{D}$ and the dimension of $X$.
Connected $ ext{TC}^ ext{D}$ with Lusternik-Schnirelmann invariants.
Abstract
In arXiv:1711.10132 a new approximating invariant for topological complexity was introduced called -topological complexity. In this paper, we explore more fully the properties of and the connections between and invariants of Lusternik-Schnirelmann type. We also introduce a new -type invariant that can be used to give an upper bound for , where is a finite dimensional simplicial complex with -connected universal cover . The above inequality is a refinement of an estimate given by Dranishnikov.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
