An algorithm to compute the Hausdorff dimension of regular branch groups

From MaRDI portal





The paper under review presents an explicit algorithm to compute the Hausdorff dimension of the closure \(\overline G\) of a regular branch group \(G\) inside an iterated wreath product \(W_H\), starting from a chosen branch structure. Working with a rooted \(m\)-adic tree and the associated level stabilizers, the authors reduce the problem to the analysis of a finite amount of data encoded in a sequence measuring successive stabilizer indices.\N\NThe main result (Theorem A) shows that \(\overline G\) is again regular branch over a suitable level stabilizer and gives an explicit expression for its Hausdorff dimension in terms of the first level quotient of \(G\) and the above sequence, which becomes eventually trivial. As a by-product, the orders of the finite quotients \(G_n\) are shown to follow an exponential law from a bounded level on.\N\NThe algorithm is implemented in GAP and applied to GGS-groups acting on the \(4\)-adic tree. In this setting, the Hausdorff dimension is computed explicitly according to the parity of the defining vector and further examples illustrate how the method can be used to rule out incompatible branch structures.











This page was built for publication: An algorithm to compute the Hausdorff dimension of regular branch groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871720)