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 more generally for the rational sectional category of a map, in terms of the rational category of a certain auxiliary space. We use our results to deduce consequences for the global (rational) homotopy structure of simply connected, hyperbolic finite complexes.
In this paper, we examine the relations of two closely related concepts, the digital Lusternik-Schnirelmann category and the digital higher topological complexity, with each other in digital images. For some certain digital images, we introduce $κ-$topological groups in the digital topological manner for having stronger ideas about the digital higher topological complexity. Our aim is to improve the understanding of the digital higher topological complexity. We present examples and counterexamples for $κ-$topological groups.
We prove an upper bound of higher topological complexity $TC_n(X)$ using higher $\mathcal{D}$-topological complexity $TC_n^{\mathcal{D}}(X)$ of a space $X$. An intermediate invariant $\widetilde{TC}_n(X)$ is used in the proof. We interpret this invariant $\widetilde{TC}_n(X)$ as higher analogue of strongly equivariant topological complexity of the universal cover of $\widetilde{X}$ with the action of the fundamental group of $X$.
We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.
In this study, we improve the topological complexity computations on digital images with introducing the digital topological complexity computations of a surjective and digitally continuous map between digital images. We also reveal differences in topological complexity computations of maps between digital images and topological spaces. Moreover, we emphasize the importance of the adjacency relation on the domain and the range of a digital map in these computations.
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 the homotopic distance. With these concepts, we give some inequalities including the topological complexity and the Lusternik-Schnirelmann category, the most important parts of the study of robot motion planning in topology. Finally, by defining the parametrised topological complexity via the homotopic distance, we present some estimates on the higher settin…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered configuration spaces of the plane.
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 invariant and several others already discussed in the literature: Farber's topological complexity, Tanaka's combinatorial complexity, and Colman-Grant's equivariant Lusternik-Schnirelmann category. We find bounds for equivariant combinatorial complexity and for the necessary lengths of equivariant combinatorial motion plannings. We show that the equivariant top…
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 the rational homotopy for some special families of coformal elliptic spaces.
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 task for which the system has been designed. From a purely topological point of view, this is a homotopy invariant of a map which generalizes the classical topological complexity of a space.
The notion of parametrized topological complexity, introduced by Cohen, Farber and Weinberger, is extended to fibrewise spaces which are not necessarily Hurewicz fibrations. After exploring some formal properties of this extension we also introduce the pointed version of parametrized topological complexity. Finally we give sufficient conditions so that both notions agree.
We obtain an explicit formula for the best lower bound for the higher topological complexity, TC_k(P^n), of real projective space implied by mod 2 cohomology.
By analogy with the invariant Q-category defined by Scheerer, Stanley and Tanré, we introduce the notions of Q-sectional category and Q-topological complexity. We establish several properties of these invariants. We also obtain a formula for the behaviour of the sectional category with respect to a fibration which generalizes the classical formulas for Lusternik-Schnirelmann category and topological complexity.
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological complexity of such mixed braid groups. In particular we show that the topological complexity of any subgroup of the n-strand braid group which fixes any two strands is 2n-3, extending a result of Farber and Yuzvinsky in the pure braid case. In addition, we generalise our results to the setting of higher topological complexity.
In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].
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.
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing a lower bound for the complexity of a polynomial-solving algorithm, and give a concrete algorithm to do this in the case that $\mathrm{deg}(f) = 2,3,4$.
We show that the (normalized) topological complexity of the Klein bottle is $4$. We also show that, for any $g\geq 2$, $TC(N_g)=4$. This completes the recent work by Dranishnikov on the topological complexity of non-orientable surfaces.
We present upper and lower bounds for symmetrized topological complexity $TC^Σ(X)$ in the sense of Basabe-González-Rudyak-Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of the symmetric square $SP^2(X)$. We also show that symmetrized topological complexity coincides with its monoidal version, where the path from a point to itself is required to be constant. Using these results, we calculate the symmetrized topological complexity of all odd spheres.
We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new invariant with those of simplicial and topological LS-category.
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 Serre path fibration, not many examples are known to be determined concretely by now. In 2010, Iwase and Sakai showed that the topological complexity of a space is a fibrewise version of a L-S category for a fibrewise space over the space. In this paper, we determine the topological complexity of $S^3/Q_8$ using a method produced from the fibrewise view point…
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal finite models of $S^1$ can be less-than-or-equal-to 3, and that the TC of the minimal finite model of any $n$-sphere is equal to 4 for $n \geq 1$. We show the former using properties of the LS-category, and we show the latter by proving that the TC of the non-Hausdorff suspension of any finite connected $T_0$ space is equal to 4. We also prove a result about the…
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 of motion planning rules needed for a continuous motion planner from $X$ to $Y$. We give basic estimates on the invariant, and we connect it to both Lusternik-Schnirelmann category and topological complexity. In the process, we compute this invariant for several example spaces including wedges of spheres, topological groups, and spatial polygon spaces. In a…
In this paper, we introduce higher symmetric simplicial complexity $SC_n^Σ(K)$ of a simplicial complex $K$ and higher symmetric combinatorial complexity $CC_n^Σ(P)$ of a finite poset $P$. These are simplicial and combinatorial approaches to symmetric motion planning of Basabe - González - Rudyak - Tamaki. We prove that the symmetric simplicial complexity $SC_n^Σ(K)$ is equal to symmetric topological complexity $TC_n^Σ(|K|)$ of the geometric realization of $K$ and the symmetric combinatorial complexity $CC_n^Σ(P)$ is equal to symmetric topological complexity $TC_n^Σ(|\mathcal{K}(P)|)$ of the ge…
We introduce the higher topological complexity (TC_{n}) of a fibration in two ways: the higher homotopic distance and the Schwarz genus. Then we have some results on this notion related to TC, TC_{n} or cat of a topological space or a fibration. We also show that TC_{n} of a fibration is a fiber homotopy equivalence.
We determine the Lusternik-Schnirelmann category of the projective product spaces introduced by D. Davis. We also obtained an upper bound for the topological complexity of these spaces, which improves the estimate given by J. González, M. Grant, E. Torres-Giese, and M. Xicoténcatl.
In this paper we introduce the concepts of higher equivariant and invariant topological complexity; and study their properties. Then we compare them with equivariant LS-category. We give lower and upper bounds for these new invariants. We compute some of these invariants for moment angle complexes.
We introduce the effectual topological complexity (ETC) of a $G$-space $X$. This is a $G$-equivariant homotopy invariant sitting in between the effective topological complexity of the pair $(X,G)$ and the (regular) topological complexity of the orbit space $X/G$. We study ETC for spheres and surfaces with antipodal involution, obtaining a full computation in the case of the torus. This allows us to prove the vanishing of twice the non-trivial obstruction responsible for the fact that the topological complexity of the Klein bottle is 4. In addition, this gives a counterexample to the possibilit…
We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces on all aspherical closed surfaces, reducing it to three possible values. The main methods used in the proofs were developed in 2015 by Grant, Lupton and Oprea to give bounds for the topological complexity of aspherical spaces. As such this paper is also part of the current effort to study the topological complexity of aspherical spaces and it presents many fu…
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 topological complexity of the ordered configuration space of two distinct points in the product $G\times\mathbb{R}^n$ and apply the results to the planar and spatial motion of two rigid bodies in $\mathbb{R}^2$ and $\mathbb{R}^3$ respectively.
The aim of this article is to review different generalizations of the the notion of topological complexity to the equivariant setting. In particular, we review the relation (or non-relation) between these notions and the topological complexity of the quotient space and the topological complexity of the fixed point sets. We give examples of calculations and stress the question: When the action is free, do we recover the topological complexity of the quotient?
