Related papers: Spaces with high topological complexity
The sphere $S^2$ and the torus $T^2$ are the only closed connected surfaces for which higher topological complexities are known (for each $n\in\{2,3,...\}\subset\mathbb{N}$, $\mathrm{TC}_n(S^2)=n$ and $\mathrm{TC}_n(T^2)=2n-2$). This text…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…
For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…
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 have initiated the study of topology of the space of coverings on grid domains. The space has the following constraint: while all the covering agents can move freely (we allow overlapping) on the domain, their union must cover the whole…
A taming symplectic structure provides an upper bound on the area of an approximately pseudoholomorphic curve in terms of its homology class. We prove that, conversely, an almost complex manifold with such an area bound admits a taming…
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…
As a first goal, it is explained why Goodwillie-Weiss calculus of embeddings offers new information about the Euclidean embedding dimension of P^m only for m < 16. Concrete scenarios are described in these low-dimensional cases, pinpointing…
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$.
Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a…
We prove a \emph{query complexity} lower bound for approximating the top $r$ dimensional eigenspace of a matrix. We consider an oracle model where, given a symmetric matrix $\mathbf{M} \in \mathbb{R}^{d \times d}$, an algorithm…
For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…
How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…
We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
For a topological space X, let (RX)s := (RX,Ts) be the cartesian product of |X| copies of the real line R with the topology of the uniform convergence on separable subsets of X. In this article we analyze the subspace C(X) of (RX)s of all…
We employ Massey products to find sharper lower bounds for the Schwarz genus of a fibration than those previously known. In particular we give examples of non-formal spaces $X$ for which the topological complexity $\TC(X)$ (defined to be…
Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…