On topological complexity and LS-category

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 Y. We use these bounds to give a counterexample to the conjecture asserting that TC(X') TC(X) for any covering map p:X' 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…