×

Analog category and complexity. (English) Zbl 07902822

Summary: We study probabilistic variants of the Lusternik-Schnirelmann category and topological complexity, which bound the classical invariants from below. We present a number of computations illustrating both wide agreement and wide disagreement with the classical notions. In the aspherical case, where our invariants are group invariants, we establish a counterpart of the Eilenberg-Ganea theorem in the torsion-free case, as well as a contrasting universal upper bound in the finite case.

MSC:

55M30 Lyusternik-Shnirel’man category of a space, topological complexity à la Farber, topological robotics (topological aspects)
60B05 Probability measures on topological spaces

References:

[1] Aguilar-Guzmán, J., González, J., and Oprea, J., Right-angled Artin groups, polyhedral products and the \(\text{tc} \)-generating function, Proc. Roy. Soc. Edinburgh A, 152 (2022), pp. 649-673. · Zbl 1530.55001
[2] Cu, T. K., Probability measures with finite supports on topological spaces, VNU J. Sci., 19 (2003), pp. 22-31.
[3] Cohen, D. and Vandembroucq, L., Topological complexity of the Klein bottle, J. Appl. Comput. Topol., 1 (2017), pp. 199-213. · Zbl 1400.55001
[4] Davis, D., Bounds for higher topological complexity of real projective space implied by \(BP\), Bol. Soc. Mat. Mex., 25 (2019), pp. 701-712. · Zbl 1428.55003
[5] Dranishnikov, A. and Jauhari, E., Distributional Topological Complexity and LS-Category, preprint, https://arxiv.org/abs/2401.04272, 2024.
[6] Espinosa Baro, A., Farber, M., Mescher, S., and Oprea, J., Sequential Topological Complexity of Aspherical Space and Sectional Categories of Subgroup Inclusions, preprint, 2023.
[7] Farber, M., Topological complexity of motion planning, Discrete Comput. Geom., 29 (2003), pp. 211-221. · Zbl 1038.68130
[8] Farber, M., Topology of robot motion planning, in Morse Theoretic Methods in Nonlinear Analysis and in Symplectic Topology, , Springer, Dordrecht, 2006.
[9] Fedorchuk, V. V., Probability measures and absolute neighborhood retracts, Soviet Math. Dokl., 22 (1986), pp. 109-122.
[10] Farber, M. and Mescher, S., On the topological complexity of aspherical spaces, J. Topol. Anal., 12 (2020), pp. 293-319. · Zbl 1455.55003
[11] Farber, M. and Oprea, J., Higher topological complexity of aspherical spaces, Topol. Appl., 258 (2019), pp. 142-160. · Zbl 1412.55003
[12] Farber, M., Tabachnikov, S., and Yuzvinsky, S., Topological robotics: Motion planning in projective spaces, Int. Math. Res. Not., (2003), pp. 1853-1870. · Zbl 1030.68089
[13] Grant, M., Lupton, G., and Oprea, J., New lower bounds for the topological complexity of aspherical spaces, Topol. Appl., 189 (2015), pp. 78-91. · Zbl 1317.55003
[14] James, I., On category, in the sense of Lusternik-Schnirelmann, Topology, 17 (1978), pp. 331-348. · Zbl 0408.55008
[15] Kallel, S. and Karoui, R., Symmetric joins and weighted barycenters, Adv. Nonlinear Stud., 11 (2011), pp. 117-143. · Zbl 1228.55009
[16] Knudsen, B., On the Stabilization of the Topological Complexity of Graph Braid Groups, preprint, https://arxiv.org/abs/2302.04346, 2023.
[17] Knudsen, B., The topological complexity of pure graph braid groups is stably maximal, Forum Math. Sigma, 10 (2022), e93. · Zbl 1505.55007
[18] Lusternik, L. and Schnirelmann, L., Méthodes topologiques dans les problèmes variationnels, Math. Gaz., 19 (1935), pp. 235-236.
[19] Rudyak, Y., On higher analogues of topological complexity, Topol. Appl., 157 (2010), pp. 916-920. · Zbl 1187.55001
[20] Smale, S., On the topology of algorithms, I, J. Complexity, 3 (1987), pp. 81-89. · Zbl 0639.68042
[21] Steenrod, N., A convenient category of topological spaces, Mich. Math. J., 14 (1967), pp. 133-152. · Zbl 0145.43002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.