The topological complexity sequence of a group—TC of its Milnor constructions—is weakly increasing and unbounded for infinite cohomological dimension, with controlled asymptotics for finite even-order groups.
Distributional topological complexity of groups.Preprint
4 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 4representative citing papers
Proves dTC(Γ)=TC(Γ) for torsion-free hyperbolic and nilpotent groups, shows dTC(L^n_p)≤2p-1 and dcat(L^n_p)≤p-1 (equality in some cases), and derives counterexamples to product formulas.
Defines a new probabilistic lower-bound invariant for parametrized topological complexity and proves it matches classical behavior on Fadell-Neuwirth fibrations and sphere bundles but differs on real projective space bundles with SO structure groups.
Analog category of a finite group is essentially proportional to the order of its largest Sylow subgroup, rendering the group-order upper bound far from optimal.
citing papers explorer
-
Topological complexity sequences of groups
The topological complexity sequence of a group—TC of its Milnor constructions—is weakly increasing and unbounded for infinite cohomological dimension, with controlled asymptotics for finite even-order groups.
-
On distributional topological complexity of groups and manifolds
Proves dTC(Γ)=TC(Γ) for torsion-free hyperbolic and nilpotent groups, shows dTC(L^n_p)≤2p-1 and dcat(L^n_p)≤p-1 (equality in some cases), and derives counterexamples to product formulas.
-
On the complexity of parametrized motion planning algorithms
Defines a new probabilistic lower-bound invariant for parametrized topological complexity and proves it matches classical behavior on Fadell-Neuwirth fibrations and sphere bundles but differs on real projective space bundles with SO structure groups.
-
On the analog category of finite groups
Analog category of a finite group is essentially proportional to the order of its largest Sylow subgroup, rendering the group-order upper bound far from optimal.