REVIEW 3 cited by
A family of level-transitive groups with positive fixed-point proportion and positive Hausdorff dimension
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
abstract
This article provides a method to calculate the fixed-point proportion of any iterated wreath product acting on a $d$-regular tree. Moreover, the method applies to a generalization of iterated wreath products acting on a $d$-regular tree, which are not groups. As an application of this generalization, a family of groups of finite type of depth $2$ acting on a $d$-regular tree with $d \geq 3$ and $d \neq 2 \pmod{4}$ is constructed. These groups are self-similar, level-transitive, have positive Hausdorff dimension, and exhibit a positive fixed-point proportion. Unlike other groups with a positive fixed-point proportion known in the literature, the fixed-point proportion of this new family can be calculated explicitly. Furthermore, the iterated Galois group of the polynomial $x^d + 1$ with $d \geq 2$ appears in this family, so its fixed-point proportion is calculated.
Forward citations
Cited by 3 Pith papers
-
Weakly branch actions: first-order theory, rigidity and Boston's conjecture
Just-infinite branch pro-p groups introduced earlier by the author are shown to be rigid on trees obtained by deleting levels, forcing every branch action on the p-adic tree to be zero-dimensional and disproving Bosto...
-
Groups of finite type: classification and structural properties
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.
-
Random subgroups of branch groups
In super strongly fractal branch profinite groups, k independent Haar-random elements generate a free subgroup acting freely on the tree boundary, almost surely.
Discussion (0). Continue with ORCID to comment.