Lower bounds for topological complexity
From MaRDI portal
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.
Recommendations
- Spaces with high topological complexity
- Topological complexity of \(H\)-spaces
- Loop topological complexity
- Topological complexity of wedges and covering maps
- Topological complexity of the work map
- An upper bound for higher topological complexity and higher strongly equivariant complexity
- Bidirectional sequential motion planning
- On topological complexity of twisted products
- Topological complexity is a fibrewise L-S category
- Topological complexity of \(n\) points on a tree
Cites work
- scientific article; zbMATH DE number 3895863 (Why is no real title available?)
- scientific article; zbMATH DE number 42968 (Why is no real title available?)
- scientific article; zbMATH DE number 1207033 (Why is no real title available?)
- scientific article; zbMATH DE number 1973373 (Why is no real title available?)
- scientific article; zbMATH DE number 3232606 (Why is no real title available?)
- Erratum to ``Topological complexity is a fibrewise L-S category [Topology Appl. 157, No 1, 10--21 (2010)]
- Fibrewise category
- Functors on the category of quasi-fibrations
- Invitation to topological robotics
- Lectures on algebraic topology.
- Partitions of unity in the theory of fibrations
- The genus of a fiber space
- Topological complexity is a fibrewise L-S category
- Topological complexity of motion planning
- Weak sectional category
Cited in
(12)- \(m\)-homotopic distance
- Lowering topological entropy over subsets
- Lower bounds for the topological entropy
- Q-topological complexity
- Bounds for higher topological complexity of real projective space implied by BP
- Relative category and monoidal topological complexity
- Spaces with high topological complexity
- Topological complexity of wedges and covering maps
- Topological lower bounds for arithmetic networks
- An upper bound for topological complexity
- Upper bound for monoidal topological complexity
- New lower bounds for the topological complexity of aspherical spaces
This page was built for publication: Lower bounds for topological complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390821)
