SearcharxivSearch

arXiv · 2502.09995

Fractal dimensions and profinite groups

Abstract

Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and $n$ is largest such that $f(n)= g(n)$. Let $S$ be a subtree of $T$ without leaves that is level-wise uniformly branching, in the sense that the number of successors of a node only depends on its level. We~show that the Hausdorff and lower box dimensions coincide for~$[S]$, and the packing and upper box dimensions also coincide. We give geometric proofs, as well as proofs based on the point-to-set principles. We use the first result to reprove a theorem of Barnea and Shalev on the Hausdorff dimension of closed subgroups of a profinite group $G$, referring only on the geometric structure of the closed subgroup in the canonical path space given by an inverse system for $G$. We obtain an analogous theorem for the packing dimension.

Explore related subjects

Keep this discovery

BibTeXRIS

Elvira Mayordomo, Andre Nies. 2025-02-14. Fractal dimensions and profinite groups. https://arxiv.org/abs/2502.09995

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