Upper bound for monoidal topological complexity

DOI10.2206/KYUSHUJM.74.197MaRDI QIDQ5119860zbMATH OpenOpenAlexFDO

Authors Norio Iwase, Mitsunobu Tsutaya

Publication date 1 September 2020

Published in Kyushu Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2206/kyushujm.74.197

zbMATH Keywords

L-S categorymonoidal topological complexitysimplicial complex

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30)

Recommendations

• Spaces with high topological complexity
• Simplicial approximation and refinement of monoidal topological complexity
• Lower bounds for topological complexity
• Topological complexity of wedges and covering maps
• An upper bound for topological complexity

Cites work

• Erratum to ``Topological complexity is a fibrewise L-S category [Topology Appl. 157, No 1, 10--21 (2010)]
• scientific article; zbMATH DE number 1973373 (Why is no real title available?)
• Topological complexity is a fibrewise L-S category
• Topological complexity of motion planning
• Topological complexity of wedges and covering maps

Cited in

(3)

• Top-pair and top-triple monotonicity
• Topological complexity of wedges and covering maps
• Simplicial approximation and refinement of monoidal topological complexity

This page was built for publication: Upper bound for monoidal topological complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119860)