pith. sign in

arxiv: 1207.7309 · v2 · pith:XXIXJ3RRnew · submitted 2012-07-31 · 🧮 math.GT · math.GN

On topological complexity and LS-category

classification 🧮 math.GT math.GN
keywords complexitytopologicalls-categoryboundsconjecturegivemonoidalresults
0
0 comments X
read the original abstract

We present some results supporting the Iwase-Sakai conjecture about coincidence of the topological complexity $TC(X)$ and monoidal topological complexity $TC^M(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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.