An upper bound for topological complexity

Michael Farber, Mark Grant, Gregory Lupton, John Oprea (Corresponding Author)

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In [11], a new approximating invariant TCD for topological complexity was introduced called D-topological complexity. In this paper, we explore more fully the properties of TCD and the connections between TCD and invariants of Lusternik-Schnirelmann type. We also introduce a new TC-type invariant TCf that can be used to give an upper bound for TC,
TC(X) ≤ TCD (X) + 2dimX − k k + 1 ,
where X is a finite dimensional simplicial complex with k-connected universal cover X˜ . The above inequality is a refinement of an estimate given by Dranishnikov [5].
Original languageEnglish
Pages (from-to)109-125
Number of pages17
JournalTopology and its Applications
Volume255
Early online date30 Jan 2019
DOIs
Publication statusPublished - 15 Mar 2019

Fingerprint

Topological Complexity
Upper bound
Invariant
Universal Cover
Simplicial Complex
Refinement
Estimate

Keywords

  • topological complexity
  • Lusternik-Schnirelmann categogory
  • Lusternik–Schnirelmann category
  • Topological complexity

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

An upper bound for topological complexity. / Farber, Michael; Grant, Mark; Lupton, Gregory; Oprea, John (Corresponding Author).

In: Topology and its Applications, Vol. 255, 15.03.2019, p. 109-125.

Research output: Contribution to journalArticle

Farber, Michael ; Grant, Mark ; Lupton, Gregory ; Oprea, John. / An upper bound for topological complexity. In: Topology and its Applications. 2019 ; Vol. 255. pp. 109-125.
@article{3c6d4220f4bc42479348fb5748b833ef,
title = "An upper bound for topological complexity",
abstract = "In [11], a new approximating invariant TCD for topological complexity was introduced called D-topological complexity. In this paper, we explore more fully the properties of TCD and the connections between TCD and invariants of Lusternik-Schnirelmann type. We also introduce a new TC-type invariant TCf that can be used to give an upper bound for TC,TC(X) ≤ TCD (X) + 2dimX − k k + 1 ,where X is a finite dimensional simplicial complex with k-connected universal cover X˜ . The above inequality is a refinement of an estimate given by Dranishnikov [5].",
keywords = "topological complexity, Lusternik-Schnirelmann categogory, Lusternik–Schnirelmann category, Topological complexity",
author = "Michael Farber and Mark Grant and Gregory Lupton and John Oprea",
note = "This work was partially supported by a grant from the Simons Foundation: (#244393 to John Oprea). The authors would like to thank the Mathematisches Forschungsinstitut Oberwolfach for its generosity in supporting a July 2017 Research in Pairs stay where this work was begun.",
year = "2019",
month = "3",
day = "15",
doi = "10.1016/j.topol.2019.01.007",
language = "English",
volume = "255",
pages = "109--125",
journal = "Topology and its Applications",
issn = "0166-8641",
publisher = "Elsevier",

}

TY - JOUR

T1 - An upper bound for topological complexity

AU - Farber, Michael

AU - Grant, Mark

AU - Lupton, Gregory

AU - Oprea, John

N1 - This work was partially supported by a grant from the Simons Foundation: (#244393 to John Oprea). The authors would like to thank the Mathematisches Forschungsinstitut Oberwolfach for its generosity in supporting a July 2017 Research in Pairs stay where this work was begun.

PY - 2019/3/15

Y1 - 2019/3/15

N2 - In [11], a new approximating invariant TCD for topological complexity was introduced called D-topological complexity. In this paper, we explore more fully the properties of TCD and the connections between TCD and invariants of Lusternik-Schnirelmann type. We also introduce a new TC-type invariant TCf that can be used to give an upper bound for TC,TC(X) ≤ TCD (X) + 2dimX − k k + 1 ,where X is a finite dimensional simplicial complex with k-connected universal cover X˜ . The above inequality is a refinement of an estimate given by Dranishnikov [5].

AB - In [11], a new approximating invariant TCD for topological complexity was introduced called D-topological complexity. In this paper, we explore more fully the properties of TCD and the connections between TCD and invariants of Lusternik-Schnirelmann type. We also introduce a new TC-type invariant TCf that can be used to give an upper bound for TC,TC(X) ≤ TCD (X) + 2dimX − k k + 1 ,where X is a finite dimensional simplicial complex with k-connected universal cover X˜ . The above inequality is a refinement of an estimate given by Dranishnikov [5].

KW - topological complexity

KW - Lusternik-Schnirelmann categogory

KW - Lusternik–Schnirelmann category

KW - Topological complexity

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

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

U2 - 10.1016/j.topol.2019.01.007

DO - 10.1016/j.topol.2019.01.007

M3 - Article

VL - 255

SP - 109

EP - 125

JO - Topology and its Applications

JF - Topology and its Applications

SN - 0166-8641

ER -