Related papers: Topological Complexity is a Fibrewise L-S Category
Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
We use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.
We study the higher (or sequential) topological complexity $\mathrm{TC}_s$ of manifolds with abelian fundamental group. We give sufficient conditions for $\mathrm{TC}_s$ to be non-maximal in both the orientable and non-orientable cases. In…
For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
We introduce the concept of parametrized homotopic distance, extending the classical notion of homotopic distance to the fibrewise setting. We establish its correspondence with the fibrewise sectional category of a specific fibrewise…
Many mechanical systems have configuration spaces that admit symmetries. Mathematically, such symmetries are modelled by the action of a group on a topological space. Several variations of topological complexity have emerged that take…
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…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
In arXiv:1711.10132 a new approximating invariant ${\mathsf{TC}}^{\mathcal{D}}$ for topological complexity was introduced called $\mathcal{D}$-topological complexity. In this paper, we explore more fully the properties of…
We develop the theory of the intertwining distributional versions of the LS-category and the sequential topological complexities of a space $X$, denoted by $\mathsf{icat}(X)$ and $\mathsf{iTC}_m(X)$, respectively. We prove that they satisfy…
We are trying to look over the Lusternik-Schnirelmann theory (L-S theory, for short) and the Topological Complexity (TC, for short) as a natural extension of the L-S theory. In particular, we focus on the impact of the ideas originated from…
Parametric boundary representation models (B-Reps) are the de facto standard in CAD, graphics, and robotics, yet converting them into valid meshes remains fragile. The difficulty originates from the unavoidable approximation of high-order…
This work is motivated by the question of whether there are spaces $X$ for which the Farber-Grant symmetric topological complexity $TC^S(X)$ differs from the Basabe-Gonz\'alez-Rudyak-Tamaki symmetric topological complexity $TC^\Sigma(X)$.…
Weighted cup-length calculations in singular cohomology led Farber and Grant in 2008 to general lower bounds for the topological complexity of lens spaces. We replace singular cohomology by K-theory, and weighted cup-length arguments by…
We design a motion planning algorithm to coordinate the movements of two robots along a figure eight track, in such a way that no collisions occur. We use a topological approach to robot motion planning that relates instabilities in motion…
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…
In this paper we describe a classifying theory for families of simplicial topological groups. If $B$ is a topological space and $G$ is a simplicial topological group, then we can consider the non-abelian cohomology $H(B,G)$ of $B$ with…
The complexity of a pair $(X,B)$ is an invariant that relates the dimension of $X$, the rank of the group of divisors, and the coefficients of $B$. If the complexity is less than one, then $X$ is a toric variety. We prove that if the…