SearcharxivSearch

arXiv · 2404.01806

Hurewicz and Dranishnikov-Smith theorems for asymptotic dimension of countable approximate groups

Abstract

We establish two main results for the asymptotic dimension of countable approximate groups. The first one is a Hurewicz type formula for a global morphism of countable approximate groups $f:(\Xi, \Xi^\infty) \to (\Lambda, \Lambda^\infty)$, stating that $\mathrm{asdim} \Xi \leq \mathrm{asdim} \Lambda +\mathrm{asdim} ([\mathrm{ker} f]_c)$. This is analogous to the Dranishnikov-Smith result for groups, and is relying on another Hurewicz type formula we prove, using a 6-local morphism instead of a global one. The second result is similar to the Dranishnikov-Smith theorem stating that, for a countable group $G$, $\mathrm{asdim} G$ is equal to the supremum of asymptotic dimensions of finitely generated subgroups of $G$. Our version states that, if $(\Lambda, \Lambda^\infty)$ is a countable approximate group, then $\mathrm{asdim} \Lambda$ is equal to the supremum of asymptotic dimensions of approximate subgroups of finitely generated subgroups of $\Lambda^\infty$, with these approximate subgroups contained in $\Lambda^2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Tobias Hartnick, Vera Tonić. 2024-04-02. Hurewicz and Dranishnikov-Smith theorems for asymptotic dimension of countable approximate groups. https://arxiv.org/abs/2404.01806

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR