Related papers: Topological complexity of real Grassmannians

We study the $\mathbb Z_2$-zero-divisor cup-length, denoted by $\operatorname{zcl}_{\mathbb Z_2}(\widetilde G_{n,3})$, of the Grassmann manifolds $\widetilde G_{n,3}$ of oriented $3$-dimensional vector subspaces in $\mathbb R^n$. Some lower…

We compute the Lusternik-Schnirelmann category and the topological complexity of no $k$-equal manifolds $M^{(k)}_d(n)$ for certain values of $d$, $k$ and $n$. This includes instances where $M^{(k)}_d(n)$ is known to be rationally…

The Lusternik-Schnirelmann category cat and topological complexity TC are related homotopy invariants. The topological complexity TC has applications to the robot motion planning problem. We calculate the Lusternik-Schnirelmann category and…

The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…

Let $G_{n,k}$ denote the real Grassmann manifold of $k$-dimensional vector subspaces of $\mathbb R^n$. Using the Hodgkin spectral sequence, we compute the complex $K$-ring of $G_{n,k}$, up to a small indeterminacy, for all values of $n,k$…

We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…

We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove…

We determine the cup-length of some oriented Grassmann manifolds by finding a Groebner basis associated with a certain subring of the cohomology of them. As its applications, we provide not only a lower but also an upper bound for the…

Using information about the rational cohomology ring of the space of oriented isometry classes of planar n-gons with specified side lengths, we obtain bounds for the zero-divisor-cup-length (zcl) of these spaces, which provide lower bounds…

We calculate the heights of Stiefel--Whitney classes of the canonical vector bundle over the oriented Grassmannians $\widetilde G_{n,4}\cong SO(n)/(SO(4)\times SO(n-4))$ in the cases $n\in\{2^t-2,2^t-1,2^t,2^t+1\}$, $t\ge4$. Using some…

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 study the geodesic motion planning problem for complete Riemannian manifolds and investigate their geodesic complexity, an integer-valued isometry invariant introduced by D. Recio-Mitter. Using methods from Riemannian geometry, we…

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

Topological complexity is a homotopy invariant that measures the minimal number of continuous rules required for motion planning in a space. In this work, we introduce persistent analogs of topological complexity and its cohomological lower…

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…

We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…

For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…

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…

The Lusternik-Schnirelmann category $cat(X)$ is a homotopy invariant which is a numerical bound on the number of critical points of a smooth function on a manifold. Another similar invariant is the topological complexity $TC(X)$ (a la…

The well-known theorem of Eilenberg and Ganea expresses the Lusternik - Schnirelmann category of an aspherical space as the cohomological dimension of its fundamental group. In this paper we study a similar problem of determining…