On higher analogs of topological complexity

From MaRDI portal
Publication:2268845

DOI10.1016/j.topol.2009.12.007zbMath1187.55001arXiv0909.1616OpenAlexW2010043691MaRDI QIDQ2268845

Yuli B. Rudyak

Publication date: 9 March 2010

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.1616




Related Items (50)

The topological complexity of pure graph braid groups is stably maximalMorita Invariance of Equivariant Lusternik-Schnirelmann Category and Invariant Topological ComplexityOn Lusternik-Schnirelmann category and topological complexity of non-\(k\)-equal manifoldsTopological complexity of the Klein bottleThe higher topological complexity of complement of fiber type arrangementRight-angled Artin groups, polyhedral products and the -generating functionSequential motion planning of non-colliding particles in Euclidean spacesAn upper bound for higher topological complexity and higher strongly equivariant complexityGenerating functions and topological complexityMaps of degree one, LS category and higher topological complexitiesAmenable covers of right‐angled Artin groupsHigher topological complexities of real Grassmannians and semi-complete real flag manifoldsHigher topological complexity of a mapThe Ganea conjecture for rational approximations of sectional categoryEstimating the higher symmetric topological complexity of spheresRational methods applied to sectional category and topological complexityTopological complexity of classical configuration spaces and related objectsTopological complexity of graphic arrangementsTopological complexity of collision-free multi-tasking motion planning on orientable surfacesTopological complexity of subgroups of Artin’s braid groupsHigher Topological Complexity of Artin Type GroupsSequential parametrized motion planning and its complexity. IISimplicial and combinatorial versions of higher symmetric topological complexityUnnamed ItemOn the growth of topological complexitySEQUENTIAL COLLISION-FREE OPTIMAL MOTION PLANNING ALGORITHMS IN PUNCTURED EUCLIDEAN SPACESHigher equivariant and invariant topological complexitiesUnnamed ItemTopological Complexities of Finite Digital ImagesHigher topological complexity of aspherical spacesFarber's conjecture for planar graphsSequential motion planning algorithms in real projective spaces: an approach to their immersion dimensionHigher homotopic distanceA lower bound for higher topological complexity of real projective spaceTopological complexity of 𝐻-spacesErratum to ``On higher analogs of topological complexityHigher dimensional simplicial complexityBounds for higher topological complexity of real projective space implied by BPBidirectional sequential motion planningModule sectional category of productsHigher topological complexity and its symmetrizationMultitasking collision-free optimal motion planning algorithms in Euclidean spacesPairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groupsSymmetrized topological complexityUnnamed ItemHigher topological complexity of hyperbolic groupsHigher analogs of simplicial and combinatorial complexitySequential parametrized motion planning and its complexityHomotopic distance between mapsA mapping theorem for topological complexity



Cites Work




This page was built for publication: On higher analogs of topological complexity