Recognition: unknown
Topological complexity sequences of groups
Pith reviewed 2026-05-08 03:05 UTC · model grok-4.3
The pith
Every group of infinite cohomological dimension has a topological complexity sequence that is weakly increasing and unbounded.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike topological complexity itself, is meaningful for groups of infinite cohomological dimension. They show that the topological complexity sequence of every group of infinite cohomological dimension is weakly increasing and unbounded. They then estimate its growth and determine its asymptotic behavior for a finite group of even order.
What carries the argument
The topological complexity sequence, formed by applying topological complexity to the successive Milnor constructions of the group.
If this is right
- The sequence serves as a well-defined invariant for groups where standard topological complexity does not apply due to infinite cohomological dimension.
- For groups of infinite cohomological dimension the sequence is at least weakly increasing at each step and tends to infinity.
- The growth of the sequence admits estimates based on the structure of the group.
- The asymptotic behavior of the sequence is determined when the group is finite of even order.
Where Pith is reading between the lines
- The sequence may distinguish groups that share the same ordinary topological complexity but differ in the complexities of their higher Milnor approximations.
- Analogous sequences built from other invariants could study growth phenomena in algebraic topology for cases of infinite cohomological dimension.
- The behavior for finite groups of odd order is left open by the current results and may follow different patterns.
Load-bearing premise
The Milnor constructions produce well-defined spaces to which the topological complexity invariant can be applied, forming a meaningful sequence even for groups of infinite cohomological dimension.
What would settle it
An explicit computation for a concrete group with infinite cohomological dimension in which the topological complexity sequence eventually becomes constant or decreases at some step.
read the original abstract
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike topological complexity itself, is meaningful for groups of infinite cohomological dimension. We show that the topological complexity sequence of every group of infinite cohomological dimension is weakly increasing and unbounded. We then estimate its growth and determine its asymptotic behavior for a finite group of even order.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper defines the topological complexity sequence of a group G as the sequence (TC(X_n)) where X_n denotes the nth Milnor construction of G. It proves that whenever the cohomological dimension of G is infinite, the sequence is weakly increasing and unbounded. The manuscript further estimates the growth rate of the sequence and determines its asymptotic behavior in the case of finite groups of even order.
Significance. If the central claims hold, the work supplies a new, well-defined invariant for groups of infinite cohomological dimension, where the ordinary topological complexity is typically undefined or infinite. The monotonicity and unboundedness results give a concrete way to extract homotopy-theoretic information from the Milnor tower, while the growth estimates for finite even-order groups provide explicit, computable data that can be compared with other sectional-category invariants. The approach relies on standard properties of Milnor constructions and the path fibration, which is a strength when the proofs are fully rigorous.
minor comments (3)
- The definition of the topological complexity sequence in the introduction should explicitly recall the precise formula for TC(X) in terms of the sectional category of the path fibration, to make the subsequent monotonicity argument self-contained.
- In the section establishing unboundedness for infinite-cd groups, the argument that TC(X_n) diverges should cite the specific cohomological or connectivity obstruction used (e.g., a non-vanishing cup product or a dimension argument) rather than appealing only to the general theory.
- The growth estimates for finite groups of even order would benefit from a short table or explicit formula comparing the sequence with the ordinary TC(G) when the latter is defined.
Simulated Author's Rebuttal
We thank the referee for their positive summary of the manuscript and for recommending minor revision. The assessment that the work provides a new invariant for groups of infinite cohomological dimension, along with monotonicity, unboundedness, and growth results, aligns with our goals. No major comments were listed in the report, so we have no specific points requiring rebuttal or clarification at this stage.
Circularity Check
No significant circularity; fresh definition with independent proofs
full rationale
The paper introduces a new definition—the topological complexity sequence as the sequence of TC values on the Milnor constructions X_n of G—and then proves that this sequence is weakly increasing and unbounded when cd(G) is infinite. These are standard-style existence and monotonicity results resting on the definition plus background facts about sectional category and Milnor joins, not on any fitted parameters, self-referential predictions, or load-bearing self-citations that reduce the claim to its own inputs. No equations or steps in the provided abstract and claims exhibit the reduction patterns (self-definitional, fitted-input-as-prediction, etc.). The derivation is therefore self-contained.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Topological complexity is a well-defined homotopy invariant for the spaces arising as Milnor constructions of groups.
- standard math Standard properties of Milnor constructions in algebraic topology hold for groups of arbitrary cohomological dimension.
invented entities (1)
-
topological complexity sequence
no independent evidence
Reference graph
Works this paper leans on
-
[1]
Adem and R.J
A. Adem and R.J. Milgram, Cohomology of finite groups, Gru ndlehren Math. Wiss. 309, Springer-Verlag, Berlin, 2004. 9
2004
-
[2]
Berstein, On the Lusternik-Schnirelmann category of Grassmannians, Math
I. Berstein, On the Lusternik-Schnirelmann category of Grassmannians, Math. Proc. Camb. Philos. Soc. 79 (1976), no. 1, 129-134. 3, 9
1976
-
[3]
Davis, A strong nonimmersion theorem for real proje ctive spaces, Ann
D.M. Davis, A strong nonimmersion theorem for real proje ctive spaces, Ann. of Math. (2) 120 (1984), no. 3, 517-528. 7
1984
-
[4]
Dranishnikov, Distributional topological complexi ty of groups, arXiv:2404.03041
A. Dranishnikov, Distributional topological complexi ty of groups, arXiv:2404.03041. 1
-
[5]
Dranishnikov, On topological complexity of hyperbol ic groups, Proc
A. Dranishnikov, On topological complexity of hyperbol ic groups, Proc. Amer. Math. Soc. 148 (2020), 4547-4556. 1
2020
-
[6]
Dranishnikov and Y
A. Dranishnikov and Y. Rudyak, On the Berstein-Svarc the orem in dimension 2, Math. Proc. Camb. Philos. Soc. 146 (2009), no. 2, 407-413. 3, 9
2009
-
[7]
Dranishnikov and R
A. Dranishnikov and R. Sadykov, The topological complex ity of the free product, Math. Z. 293 (2019), no. 1-2, 407-416. 1
2019
-
[8]
Espinosa Baro, M
A. Espinosa Baro, M. Farber, S. Mescher and J. Oprea, Sequ ential topological complexity of aspherical spaces and sectional categories of subgroup i nclusions, Math. Ann. 391 (2025), no. 3, 4555-4605. 1, 5, 10
2025
-
[9]
Farber, Topological complexity of motion planning, D iscrete Comput
M. Farber, Topological complexity of motion planning, D iscrete Comput. Geom. 29 (2003), no. 2, 211-221. 1, 2, 3
2003
-
[10]
T opology and robotics
M. Farber and M. Grant, Symmetric motion planning, In “T opology and robotics” M. Farber et al (eds), Contemp. Math. 438 (2007), 85-104. 3, 8
2007
-
[11]
Farber and M
M. Farber and M. Grant, Robot motion planning, weights o f cohomology classes, and coho- mology operations, Proc. Amer. Math. Soc. 136 (2008), no. 9, 3339-3349. 10 12 DAISUKE KISHIMOTO AND YUKI MINOW A
2008
-
[12]
Farber, M
M. Farber, M. Grant, G. Lupton, and J. Oprea, Bredon coho mology and robot motion plan- ning, Algebr. Geom. Topol. 19 (2019), 2023-2059. 1, 4
2019
-
[13]
Farber, M
M. Farber, M. Grant, G. Lupton, and J. Oprea, An upper bou nd for topological complexity, Topology Appl. 225 (2019), 109-125. 1, 4, 5, 6
2019
-
[14]
Farber, S
M. Farber, S. Tabachnikov, and S. Yuzvinsky, Motion Pla nning in projective spaces, IMRN 34 (2003), 1853-1870. 2, 7
2003
-
[15]
Ganea, Lusternik-Schnirelmann category and strong category, Illinois
T. Ganea, Lusternik-Schnirelmann category and strong category, Illinois. J. Math. 11 (1967), 417-427. 2
1967
-
[16]
Garc ´ ıa Calcines and L
J.M. Garc ´ ıa Calcines and L. Vandembroucq, Topological complexity and the homotopy cofibre of the diagonal map, Math. Z. 274 (2013), no. 1-2, 145-165. 4
2013
-
[17]
Algebraic Topology - Old and New: M.M. Postnikov Memorial Conference
M. Grant, Topological complexity of motion planning an d Massey products, In “Algebraic Topology - Old and New: M.M. Postnikov Memorial Conference” , M. Golasi´ nski et al (eds), Banach Center Publ. 85 (2009), 193-203. 9
2009
-
[18]
Grant, Parametrised topological complexity of grou p epimorphisms, Topol
M. Grant, Parametrised topological complexity of grou p epimorphisms, Topol. Methods Non- linear Anal. 60 (2022), no. 1, 287-303. 1
2022
-
[19]
Topological Complexity and Related Topics
M. Grant and D. Recio-Mitter, Topological complexity o f subgroups of Artin’s braid groups, in “Topological Complexity and Related Topics”, M. Grant, G . Lupton and L. Vandembroucq (eds), Contemp. Math. 702 (2018), 165-176. 1
2018
-
[20]
Iwase, A∞ -method in Lusternik-Schnirelmann category, Topology 41 (2002), 695-723
N. Iwase, A∞ -method in Lusternik-Schnirelmann category, Topology 41 (2002), 695-723. 2
2002
-
[21]
Iwase and Y
N. Iwase and Y. Miyata, Topological complexity of S3/Q8 as fibrewise L-S category, Topol. Methods Nonlinear Anal. 62 (2023), no. 1, 239-265. 9
2023
-
[22]
James, Euclidean models of projective spaces, Bul l
I.M. James, Euclidean models of projective spaces, Bul l. London Math. Soc. 3 (1971), 257-
1971
-
[23]
Knudsen, The topological complexity of pure graph br aid groups is stably maximal, Forum Math
B. Knudsen, The topological complexity of pure graph br aid groups is stably maximal, Forum Math. Sigma 10 (2022), e93. 1
2022
-
[24]
Knudsen, On the stabilization of the topological com plexity of graph braid groups, arXiv:2302.04346
B. Knudsen, On the stabilization of the topological com plexity of graph braid groups, arXiv:2302.04346. 1
-
[25]
Minowa, On the topological complexity of non-simply connected spaces, arXiv:2603.09407
Y. Minowa, On the topological complexity of non-simply connected spaces, arXiv:2603.09407. 9
-
[26]
Rudyak, On higher analogs of topological complexi ty, Topology Appl
Y.B. Rudyak, On higher analogs of topological complexi ty, Topology Appl. 157 (2010), no. 5, 916-920. 11
2010
-
[27]
˘Svarc, The genus of a fibered space, Trudy Moscov
A. ˘Svarc, The genus of a fibered space, Trudy Moscov. Mat. Obsc. 10, 11 (1961 and 1962), 217-272, 99-126, (in Amer. Math. Soc. Transl. Series 2, 55 (1966)). 3, 5, 9
1961
-
[28]
Tomoda and P
S. Tomoda and P. Zvengrowski, Remarks on the cohomology of finite fundamental groups of 3-manifolds, Geom. Topol. Monogr. 14 (2008), 519-556. 9 F aculty of Mathematics, Kyushu University, Fukuoka, 819-03 95, Japan Email address : kishimoto@math.kyushu-u.ac.jp F aculty of Mathematics, Kyushu University, Fukuoka, 819-03 95, Japan Email address : y-minowa@mat...
2008
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.