Lower bounds for topological complexity
arXiv:1110.6876 · doi:10.1016/j.topol.2013.03.012
Abstract
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of the cohomology ring. The relationships between these lower bounds are studied.
19 pages, 1 figure