Pith. sign in

REVIEW 1 cited by

Nearly Maximal Hausdorff Dimension in Finitely Constrained Groups

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.05261 v1 pith:DZ2WKXBH submitted 2017-10-15 math.GR

classification math.GR
keywords finitelydimensiongroupshausdorffconstrainedmaximalnearlyautomorphisms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Groups of finite type: classification and structural properties

    math.GR 2025-09 conditional novelty 7.0 of 10

    For many groups of finite type, topological finite generation, just-infiniteness and strong completeness are equivalent, and new algorithms classify the groups up to isomorphism on binary and ternary trees.

Pith tools