Related papers: Sequential parametrized topological complexity and…
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…
In this paper, we introduce and study sequential versions of several fibrewise homotopy invariants, including parametrized topological complexity, parametrized (subspace) homotopic distance. We investigate their basic properties, establish…
In this paper we study symmetric motion planning algorithms, i.e. such that the motion from one state A to another B, prescribed by the algorithm, is the time reverse of the motion from B to A. We experiment with several different notions…
Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. Instead of expressing the running time of an algorithm as a function of the input size only, running times are expressed with respect to…
The higher topological complexity of a space $X$, $\text{TC}_r(X)$, $r=2,3,\ldots$, and the topological complexity of a map $f$, $\text{TC}(f)$, have been introduced by Rudyak and Pave\v{s}i\'{c}, respectively, as natural extensions of…
We study a natural variant of scheduling that we call \emph{partial scheduling}: In this variant an instance of a scheduling problem along with an integer $k$ is given and one seeks an optimal schedule where not all, but only $k$ jobs, have…
In this paper we study the topological invariant ${\sf {TC}}(X)$ reflecting the complexity of algorithms for autonomous robot motion. Here, $X$ stands for the configuration space of a system and ${\sf {TC}}(X)$ is, roughly, the minimal…
Topological complexity was first introduced in 2003 by Michael Farber as a homotopy invariant for a connected topological space X, denoted by TC(X). Although the invariant is defined in terms of elementary homotopy theory using well-known…
The rapid evolution of network services demands new paradigms for studying and designing networks. In order to understand the underlying mechanisms that provide network functions, we propose a framework which enables the functional analysis…
Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…
Parametrized motion planning algorithms have high degrees of universality and flexibility, as they are designed to work under a variety of external conditions, which are viewed as parameters and form part of the input of the underlying…
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 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…
We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…
Parallel parameterized complexity theory studies how fixed-parameter tractable (fpt) problems can be solved in parallel. Previous theoretical work focused on parallel algorithms that are very fast in principle, but did not take into account…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
There are families of physical systems that cannot be adiabatically evolved to the trivial system uniformly across the parameter space, even if each system in the family belongs to the trivial phase. The obstruction is measured by higher…
We introduce and study the proper topological complexity of a given configuration space, a version of the classical invariant for which we require that the algorithm controlling the motion is able to avoid any possible choice of ``unsafe''…
This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this…
The Topological complexity a la Farber $\text{TC}(-)$ is a homotopy invariant which have interesting applications in Robotics, specifically, in the robot motion planning problem. In this work we calculate the topological complexity of the…