Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

On topological complexity and LS-category (1207.7309v2)

Published 31 Jul 2012 in math.GT and math.GN

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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