arXiv · 1110.6876
Lower bounds for topological complexity
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.
Explore related subjects
Keep this discovery
Aleksandra Franc, Petar Pavešić. 2011-10-31. Lower bounds for topological complexity. https://doi.org/10.1016/j.topol.2013.03.012
Cite the original work for its findings. Save a collection to share your selection of sources.