相关论文: Effective topological complexity of spaces with sy…

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…

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 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…

Topological complexity for spaces was introduced by M. Farber as a minimal number of continuity domains for motion planning algorithms. It turns out that this notion can be extended to the case of not necessarily commutative C*-algebras.…

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…

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…

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…

We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…

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 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 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''…

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…

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$.

Crystalline symmetries give rise to topological invariants that can distinguish quantum phases of matter. Understanding these in strongly interacting systems is an ongoing research direction requiring non-perturbative methods. Recent…

We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…

Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…

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 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…

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…

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…