Symmetrized topological complexity

Mark Grant (Corresponding Author)

Research output: Contribution to journalArticle

5 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 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.
Original languageEnglish
Pages (from-to)387-403
Number of pages17
JournalJournal of Topology and Analysis
Volume11
Issue number2
Early online date5 Oct 2017
DOIs
Publication statusPublished - 1 Jun 2019

Fingerprint

Topological Complexity
Obstruction Theory
Equivariant
Cohomology
Upper and Lower Bounds
Odd
Lower bound
Upper bound
Calculate
Path

Keywords

  • Topological complexity
  • topological robotics
  • equivariant homotopy theory
  • symmetric products
  • COHOMOLOGY
  • CATEGORY

ASJC Scopus subject areas

  • Analysis
  • Geometry and Topology

Cite this

Symmetrized topological complexity. / Grant, Mark (Corresponding Author).

In: Journal of Topology and Analysis, Vol. 11, No. 2, 01.06.2019, p. 387-403.

Research output: Contribution to journalArticle

@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 = "6",
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

VL - 11

SP - 387

EP - 403

JO - Journal of Topology and Analysis

JF - Journal of Topology and Analysis

SN - 1793-5253

IS - 2

ER -