Papers
Topics
Authors
Recent
Search
2000 character limit reached

On topological complexity and LS-category

Published 31 Jul 2012 in math.GT and math.GN | (1207.7309v2)

Abstract: We present some results supporting the Iwase-Sakai conjecture about coincidence of the topological complexity $TC(X)$ and monoidal topological complexity $TCM(X)$. Using these results we provide lower and upper bounds for the topological complexity of the wedge $X\vee Y$. We use these bounds to give a counterexample to the conjecture asserting that $TC(X')\le TC(X)$ for any covering map $p:X'\to X$. We discuss a possible reduction of the monoidal topological complexity to the LS-category. Also we apply the LS-category to give a short proof of the Arnold-Kuiper theorem.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Authors (1)

Collections

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