2014
DOI: 10.2140/agt.2014.14.223
|View full text |Cite
|
Sign up to set email alerts
|

Higher topological complexity and its symmetrization

Abstract: Abstract. We develop the properties of the n-th sequential topological complexity TC n , a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in robotics. We exhibit close connections of TC n (X) to the Lusternik-Schnirelmann category of cartesian powers of X, to the cup-length of the diagonal embedding X → X n , and to the ratio between homotopy dimension and connectivity of X. We fully compute the numerical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
22
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(24 citation statements)
references
References 21 publications
1
22
0
1
Order By: Relevance
“…The notion of the nth sequential or higher topological complexity was introduced by Rudyak in [9] and further developed in [1]. We follow [10] to recall the basic definitions and properties.…”
Section: Preliminary Resultsmentioning
confidence: 99%
“…The notion of the nth sequential or higher topological complexity was introduced by Rudyak in [9] and further developed in [1]. We follow [10] to recall the basic definitions and properties.…”
Section: Preliminary Resultsmentioning
confidence: 99%
“…The "higher" or "sequential" topological complexity TC r is a numerical homotopy invariant defined in [Rud10] and developed in [BGRT14], recovering Farber's topological complexity [Far03] for r = 2 and the Lusternik-Schnirelmann category for r = 1. The reader is referred to these references for definitions; we recall only that 1 r TC r is bounded by the homotopy dimension in non-pathological settings.…”
Section: A General Lower Boundmentioning
confidence: 99%
“…Do đó, thông thường ta chỉ có thể đưa ra các chặn trên và chặn dưới cho bất biến này. Trong [3], [4], [5] các tác giả đã đưa ra một số kết quả về độ phức tạp tôpô bậc cao cho một số không gian cụ thể.…”
Section: độ Phức Tạp Tôpô Bậc Cao Của Tích Các Không Gian Tôpôunclassified