Daniel C. Cohen
We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to certain discrete groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A study of the Ganea conjecture for topological complexity by using weak topological complexity
该研究借助 Berstein-Hilton 弱拓扑复杂度及其稳定形式，给出空间满足拓扑复杂度 Ganea 猜想的充分条件，并通过若干例子加以说明。
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 determine the symmetrized topological complexity of the circle, using primarily just general topology.
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.
Rational sequential parametrized topological complexity
本文从有理同伦理论角度研究序列参数化拓扑复杂度，在纤维丛允许某种分解时给出了显式代数上界，推广了已有拓扑复杂度结果。
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 use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.
The functor that takes a manifold to its configuration category exhibits a type of full faithfulness in some cases.
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…
Parametrized topological complexity of spherical fibrations over spheres
本文研究了球面纤维化的参数化拓扑复杂度，通过弱范畴计算下界并确定了某些纤维化的具体值。
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 prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is as low as possible, namely n-1.
Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.
Sequential parametrized topological complexity of group epimorphisms
本文引入群满同态的序列参数化拓扑复杂度，推广了序列拓扑复杂度，利用子群上同调维数给出其界，并应用于平面Fadell-Neuwirth纤维化的计算。
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.
Topological complexity sequences of groups
本文定义了群的拓扑复杂度序列，作为其米尔诺构造的拓扑复杂度序列。该序列是对群拓扑复杂度的内在细化，且适用于无限余维数群。证明了无限余维数群的拓扑复杂度序列弱递增且无界，并确定了有限偶阶群的渐进行为。
Higher Analogues of Discrete Topological Complexity
本研究引入第n阶离散拓扑复杂度，探究其与单纯Lusternik-Schnirelmann畴数的关系及不同维度间的关联，得出其由对应复形几何实现的第n阶通常拓扑复杂度给出的下界，并给出严格不等的实例。
On the topological complexity of directed parametrized motion planning
本文研究了有向参数化运动规划的拓扑复杂度，引入了相关概念并探讨了其与拓扑机器人学中其他不变量的关系。
We show how locally smooth actions of compact Lie groups on a manifold $X$ can be used to obtain new upper bounds for the topological complexity $\TC(X)$, in the sense of Farber. We also obtain new bounds for the topological complexity of finitely generated torsion-free nilpotent groups.
On the topological complexity of non-simply connected spaces
本文研究了非单连通空间的拓扑复杂性，通过引入上同调类和谱序列，扩展了现有结果并确定了某些3流形的拓扑复杂性。
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.
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of the topological complexity of the configuration space of n distinct points in Euclidean m-space for all m>1$ and n>1; the answer was previously known in the cases m=2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.
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 show that the directed topological complexity (as defined by E. Goubault) of the directed $n$-sphere is $2$, for all $n\ge1$.
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 introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of the cohomology ring. The relationships between these lower bounds are studied.
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.
This article has been withdrawn due to an error in a proof of the main result.
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…
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 higher complexities, we define their symmetric versions that can also be regarded as higher analogs of the symmetric topological complexity.
Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any straight-line polygons.
Equivariant parametrized topological complexity
本文定义并研究了参数化拓扑复杂度的等变类似物，推广了非等变情形的若干结果，给出了其纤维wise等变同伦不变性及若干界，并计算了特定等变纤维化的该复杂度。
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…
Group actions and higher topological complexity of lens spaces
该研究得到纤维化全空间高阶拓扑复杂度的上界，结合高阶子空间拓扑复杂度、紧李群作用改进相关上界，并据此算出多种情形下高维透镜空间高阶拓扑复杂度的精确值。
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.
Manifolds with small topological complexity
本研究聚焦拓扑复杂度≤3的闭可定向流形，确定了其上同调环，还对部分可容许上同调环识别出同胚意义下的对应流形，推进了低拓扑复杂度流形的分类研究。
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.
If a map $f$ has a homotopy retraction, then Doeraene and El Haouari conjectured that the sectional category and the relative category of $f$ are the same. In this work we discuss this conjecture for some lower bounds of these invariants. In particular, when we consider the diagonal map, we obtain results supporting Iwase-Sakai's conjecture which asserts that the topological complexity is the monoidal topological complexity.
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.
Higher topological complexity of planar polygon spaces having small genetic codes
本文将Davis关于小遗传密码平面多边形空间拓扑复杂度的界推广到更高拓扑复杂度，并在维数$m$为2的幂时确定其第$k$阶值为$km$或$km+1$。
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 relationship of these invariants with the equivariant Lusternik-Schnirelmann category is given. Several examples and computations serve to highlight the similarities and differences with the non-equivariant case. We also indicate how the equivariant topological complexity can be used to give estimates of the non-equivariant topological complexity.
Higher topological complexity of Seifert fibered manifolds
本文研究了Seifert纤维化流形的更高拓扑复杂性，通过引入权重概念，证明了其拓扑复杂性范围及特定条件下精确值。
Equivariant and invariant parametrized topological complexity
本文研究了G-等变纤维的不变参数拓扑复杂性，推广了Lubawski和Marzantowicz的不变拓扑复杂性，并计算了等变Fadell-Neuwirth纤维的不变参数拓扑复杂性，用于运动规划问题。
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.
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 that, $TC_s(U \mathcal{C}^nT) = s(hdim (U \mathcal{C}^nT))$ where $hdim$ stands for the homotopy dimension.
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?
LS-category and topological complexity of Milnor manifolds and corresponding generalized projective product spaces
本文研究了Milnor流形及相应广义射影积空间的LS-范畴与拓扑复杂度，确定了其精确值或紧致界限，并计算了等变情形下的界限及利用mod-2上同调环推导了相关空间的界限。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。