Symmetrized topological complexity

Mark Grant

doi:10.1142/S1793525319500183

Symmetrized topological complexity

Mark Grant^* (Corresponding Author)

^*Corresponding author for this work

Mathematical Science

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

20 Downloads (Pure)

Abstract

We present upper and lower bounds for symmetrized topological complexity TC^Σ(X) in the sense of Basabe–Gonzalez–Rudyak–Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of the symmetric square SP² (X). We also show that symmetrized topological complexity coincides with its monoidal version, where the path from a point to itself is required to be constant. Using these results, we calculate the symmetrized topological complexity of all odd spheres.

Original language	English
Pages (from-to)	387-403
Number of pages	17
Journal	Journal of Topology and Analysis
Volume	11
Issue number	2
Early online date	5 Oct 2017
DOIs	https://doi.org/10.1142/S1793525319500183
Publication status	Published - 1 Jun 2019

Keywords

Topological complexity
topological robotics
equivariant homotopy theory
symmetric products
COHOMOLOGY
CATEGORY

Access to Document

10.1142/S1793525319500183Licence: Unspecified

Accepted Manuscript
Electronic version of an article published as Grant M. Symmetrized topological complexity. Journal of Topology and Analysis. Vol. 11, No. 02, pp. 387-403 (2019). Available from, DOI: 10.1142/S1793525319500183 © 2017 World Scientific Publishing Company.
Accepted author manuscript, 211 KBLicence: Unspecified

https://arxiv.org/abs/1703.07142Licence: Unspecified

Cite this

@article{5bc3933250a542f5ab3daf40a104b55a,

title = "Symmetrized topological complexity",

abstract = "We present upper and lower bounds for symmetrized topological complexity TCΣ(X) in the sense of Basabe–Gonzalez–Rudyak–Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of the symmetric square SP2 (X). We also show that symmetrized topological complexity coincides with its monoidal version, where the path from a point to itself is required to be constant. Using these results, we calculate the symmetrized topological complexity of all odd spheres.",

keywords = "Topological complexity, topological robotics, equivariant homotopy theory, symmetric products, COHOMOLOGY, CATEGORY",

author = "Mark Grant",

year = "2019",

month = jun,

day = "1",

doi = "10.1142/S1793525319500183",

language = "English",

volume = "11",

pages = "387--403",

journal = "Journal of Topology and Analysis",

issn = "1793-5253",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "2",

}

TY - JOUR

T1 - Symmetrized topological complexity

AU - Grant, Mark

PY - 2019/6/1

Y1 - 2019/6/1

N2 - We present upper and lower bounds for symmetrized topological complexity TCΣ(X) in the sense of Basabe–Gonzalez–Rudyak–Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of the symmetric square SP2 (X). We also show that symmetrized topological complexity coincides with its monoidal version, where the path from a point to itself is required to be constant. Using these results, we calculate the symmetrized topological complexity of all odd spheres.

AB - We present upper and lower bounds for symmetrized topological complexity TCΣ(X) in the sense of Basabe–Gonzalez–Rudyak–Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of the symmetric square SP2 (X). We also show that symmetrized topological complexity coincides with its monoidal version, where the path from a point to itself is required to be constant. Using these results, we calculate the symmetrized topological complexity of all odd spheres.

KW - Topological complexity

KW - topological robotics

KW - equivariant homotopy theory

KW - symmetric products

KW - COHOMOLOGY

KW - CATEGORY

UR - http://www.scopus.com/inward/record.url?scp=85030872621&partnerID=8YFLogxK

UR - http://www.mendeley.com/research/symmetrized-topological-complexity

U2 - 10.1142/S1793525319500183

DO - 10.1142/S1793525319500183

M3 - Article

SN - 1793-5253

VL - 11

SP - 387

EP - 403

JO - Journal of Topology and Analysis

JF - Journal of Topology and Analysis

IS - 2

ER -

Symmetrized topological complexity

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Mark Grant

Cite this

Symmetrized topological complexity

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Profiles

Mark Grant

Cite this