Finitely constrained groups of maximal Hausdorff dimension
Abstract
We prove that if GP is a finitely constrained group of binary rooted tree automorphisms (a group binary tree subshift of finite type) defined by an essential pattern group P of pattern size d, d>1, and if GP has maximal Hausdorff dimension (equal to 1-1/2d-1), then GP is not topologically finitely generated. We describe precisely all essential pattern groups P that yield finitely constrained groups with maximal Haudorff dimension. For a given size d, d>1, there are exactly 2d-1 such pattern groups and they are all maximal in the group of automorphisms of the finite rooted regular tree of depth d.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.