Invariant topological complexity
Authors:
- Wojciech Lubawski,
- Wacław Bolesław Marzantowicz
Abstract
We present a new approach to an equivariant version of Farber's topological complexity called invariant topological complexity. It seems that the presented approach is more adequate for the analysis of impact of a symmetry on a motion planning algorithm than the one introduced and studied by Colman and Grant. We show many bounds for the invariant topological complexity comparing it with already known invariants and prove that in the case of a free action it is equal to the topological complexity of the orbit space. We define the Whitehead version of it.
- Record ID
- UAM1f3378a502c74357b1c026c68595923e
- Author
- Journal series
- Bulletin of the London Mathematical Society, ISSN 0024-6093
- Issue year
- 2015
- Vol
- 47
- No
- 1
- Pages
- 101-117
- ASJC Classification
- DOI
- DOI:10.1112/blms/bdu090 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 30
- Score source
- journalList
- Score
- Publication indicators
- = 6; = 8; : 2015 = 1.193; : 2015 (2 years) = 0.789 - 2015 (5 years) =0.788
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM1f3378a502c74357b1c026c68595923e/
- URN
urn:amu-prod:UAM1f3378a502c74357b1c026c68595923e
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.