Related papers: Formal aspects on parametrized topological complex…
We study Farber's topological complexity for monotone symplectic manifolds. More precisely, we estimate the topological complexity of 4-dimensional spherically monotone manifolds whose Kodaira dimension is not $-\infty$.
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…
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…
We introduce an alternative formalization of curved spaces in which the concept of a pointwise affine space, as defined here, replaces that of a manifold. New or modified definitions of familiar notions from differential geometry such as…
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…
In their previous work, Barraud and Cornea enriched the Lagrangian Floer complex by adding cubical chains in the based loop space of the Lagrangian, and recovered the Leray-Serre spectral sequence of the based path space fibration, assuming…
This short note introduces a notion of directed homotopy equivalence and of "directed" topological complexity (which elaborates on the notion that can be found in e.g. Farber's book) which have a number of desirable joint properties. In…
We introduce the higher topological complexity (TC_{n}) of a fibration in two ways: the higher homotopic distance and the Schwarz genus. Then we have some results on this notion related to TC, TC_{n} or cat of a topological space or a…
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…
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…
Farber introduced a notion of topological complexity $\TC(X)$ that is related to robotics. Here we introduce a series of numerical invariants $\TC_n(X), n=1,2, ...$ such that $\TC_2(X)=\TC(X)$ and $\TC_n(X)\le \TC_{n+1}(X)$. For these…
Farber and Rudyak introduced topological complexity $\mathbf{TC}(X)$ of motion planning and its higher analogs $\mathbf{TC}_n(X)$ to measure the complexity of assigning paths to point tuples. Motivated by motion planning where a robotic…
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can…
We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion…
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 introduce fibrewise compactifications in both the setting of locally compact Hausdorff spaces and continuous maps, and the parallel setting of $C^*$-algebras and nondegenerate multiplier-valued $*$-homomorphisms. In both situations, we…
The rich analytic structure of hadronic form factors makes a theoretically consistent yet easily applicable parametrisation cumbersome. Consequently, most parametrisations are limited to reproducing the simplest analytic features sufficient…
In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully…
Hirzebruch surfaces, defined as the projectivization of line bundles over $\C\mathbb{P}^1$, support a toric action and thus represent an infinite class of symplectic toric manifolds of complex dimension 2. In this paper, an infinite class…
Parametrized motion planning algorithms \cite{CFW} have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute…