Related papers: Parametrised topological complexity of group epimo…
We introduce and study the sequential analogue of Grant's parametrized topological complexity of group epimorphisms, which generalizes the sequential topological complexity of groups. We derive bounds for sequential parametrized topological…
In this paper, we define and study an equivariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity. We show that several results in the non-equivariant case can be extended to the equivariant case. For example,…
For a $G$-equivariant fibration $p \colon E\to B$, we introduce and study the invariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity, called the invariant parametrized topological complexity. This notion…
We show how locally smooth actions of compact Lie groups on a manifold $X$ can be used to obtain new upper bounds for the topological complexity $\TC(X)$, in the sense of Farber. We also obtain new bounds for the topological complexity of…
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…
The notion of parametrized topological complexity, introduced by Cohen, Farber and Weinberger, is extended to fibrewise spaces which are not necessarily Hurewicz fibrations. After exploring some formal properties of this extension we also…
We introduce and study a parametrized analogue of the directed topological complexity, originally developed by Goubault, Farber, and Sagnier. We establish the fibrewise basic dihomotopy invariance of directed parametrized topological…
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…
We establish a stable homotopy-theoretic version of a recent result of Farber and Weinberger on the fibrewise topological complexity of sphere bundles and prove, by closely parallel methods, a similar result for real, complex and…
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…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
We define and study an equivariant version of Farber's topological complexity for spaces with a given compact group action. This is a special case of the equivariant sectional category of an equivariant map, also defined in this paper. The…
We develop a theory of generalized Hopf invariants in the setting of sectional category. In particular we show how Hopf invariants for a product of fibrations can be identified as shuffle joins of Hopf invariants for the factors. Our…
We find conditions which ensure that the topological complexity of a closed manifold $M$ with abelian fundamental group is nonmaximal, and see through examples that our conditions are sharp. This generalizes results of Costa and Farber on…
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…
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
In this article, we investigate the higher topological complexity of oriented Seifert fibered manifolds that are Eilenberg--MacLane spaces $K(G,1)$ with infinite fundamental group $G$. We first refine the cohomological lower bounds for…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…