SearcharxivSearch

arXiv · 1710.05261

Nearly Maximal Hausdorff Dimension in Finitely Constrained Groups

Abstract

This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree automorphisms with pattern size $d$ and having Hausdorff dimension $1 - \frac{2}{2^{d-1}}$. As part of this proof, we describe the finite patterns that can define such groups, which leads to the fact that all finitely constrained groups of nearly maximal Hausdorff dimension have additive portraits. Additionally, we give an upper bound, in terms of the pattern size $d$, on the number of topologically finitely generated instances with nearly maximal Hausdorff dimension for a given $d$, by applying corollaries of the criteria of Bondarenko and Samoilovych. We also construct a new family of examples of finitely constrained, topologically finitely generated groups with nearly maximal Hausdorff dimension. We conclude by positing several open questions.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Penland. 2017-10-15. Nearly Maximal Hausdorff Dimension in Finitely Constrained Groups. https://arxiv.org/abs/1710.05261

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