2000 character limit reached
On distributional topological complexity of groups and manifolds
Published 20 Sep 2025 in math.GT, math.AT, and math.GR | (2509.16759v1)
Abstract: We prove the equality $\dTC(\Gamma)=\TC(\Gamma)$ for distributional topological complexity of torsion free hyperbolic and of torsion free nilpotent groups. For the distributional topological complexity of lens spaces we prove the inequality $\dTC(Ln_p)\le 2p-1$ and for the distributional LS-category the inequality $d\cat(Ln_p)\le p-1$ which turns into equality for prime $p$ and $n>p$. We use these inequalities to bring counter-examples to the product formula for $d\cat$ and $\dTC$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.