Related papers: Spaces of Topological Complexity One
Let TC$_n$(X) denote the n-th topological complexity of a topological space X. It is known that TC$_n$(X) does not exceed n-1 for non-contractible X, and so it makes sense to describe spaces X with TC$_n$(X) =n-1. Grant--Lupton--Oprea…
We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…
Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(X^n), for n >= 1, where TC_{n+1}(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the…
We define the notion of {\em classifying space} of a topological stack and show that every topological stack \X has a classifying space X which is a topological space well-defined up to weak homotopy equivalence. Under a certain…
Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…
By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…
Using known results about their mod-2 cohomology ring, we prove that the topological complexity of the space of isometry classes of n-gons in the plane with one side of length r and all others of length 1 equals either 2n-5 or 2n-6,…
We prove that a locally compact space with an upper curvature bound is a topological manifold if and only if all of its spaces of directions are homotopy equivalent and not contractible. We discuss applications to homology manifolds, limits…
Given a space $X$, the topological complexity of $X$, denoted by $TC(X)$, can be viewed as the minimum number of "continuous rules" needed to describe how to move between any two points in $X$. Given subspaces $Y_1$ and $Y_2$ of $X$, there…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
In this paper we analyze some relationships between the topological complexity of a space $X$ and the category of $C_{\Delta_X},$ the homotopy cofibre of the diagonal map $\Delta_X:X\rightarrow X\times X.$ We establish the equality of the…
Given a simplicial complex $X$, we construct a simplicial complex $\Omega X$ that may be regarded as a combinatorial version of the based loop space of a topological space. Our construction explicitly describes the simplices of $\Omega X$…
Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…
The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…
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…
We present upper and lower bounds for symmetrized topological complexity $TC^\Sigma(X)$ in the sense of Basabe-Gonz\'alez-Rudyak-Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of…
This paper investigates sufficient and necessary conditions for the existence of a homotopy equivalence between two finite simplicial complexes from an algorithmic point of view. As a result, the conditions are formulated in terms of the…
The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…