Related papers: Projective product coverings and sequential motion…

The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…

This work is motivated by the question of whether there are spaces $X$ for which the Farber-Grant symmetric topological complexity $TC^S(X)$ differs from the Basabe-Gonz\'alez-Rudyak-Tamaki symmetric topological complexity $TC^\Sigma(X)$.…

We study Farber's topological complexity (TC) of Davis' projective product spaces (PPS's). We show that, in many non-trivial instances, the TC of PPS's coming from at least two sphere factors is (much) lower than the dimension of the…

In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…

Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…

We introduce the digital projective product spaces based on Davis' projective product spaces. We determine an upper bound for the digital LS-category of the digital projective product spaces. In addition, we obtain an upper bound for 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 an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space.…

We show that the space $\tilde{A}_{d}(m,n)$ consisting of all real projective classes of $(n+1)$-tuples of real coefficients homogeneous polynomials of degree $d$ in $(m+1)$ variables, without common real roots except zero, has the same…

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…

Let $t$ be a positive integer. Following work of D. M. Davis, we study the topology of complex-projective product spaces, i.e. quotients of cartesian products of odd dimensional spheres by the diagonal $S^1$-action, and of the $t$-torsion…

We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…

We use Brown-Peterson cohomology to obtain lower bounds for the higher topological complexity, TC_k(RP^n), of real projective spaces, which are often much stronger than those implied by ordinary mod-2 cohomology.

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

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…

In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with…

Inspired by the analogous result in the algebraic setting (Theorem 1) we show (Theorem 2) that the product $M \times \mathbb{R}P^n$ of a closed and orientable topological manifold $M$ with the $n$-dimensional real projective space cannot be…

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…