Weakly branch actions: first-order theory, rigidity and Boston's conjecture
Jorge Fari\~na-Asategui

TL;DR
This paper disproves Boston's conjecture by analyzing the rigidity of weakly branch actions, extending the structure graph concept, and establishing new criteria for rigidity, ultimately providing counterexamples among certain pro-p groups.
Contribution
It generalizes the structure graph to weakly branch groups, characterizes rigidity of actions on trees, and connects Hausdorff dimension with rigidity, leading to counterexamples to Boston's conjecture.
Findings
Disproved Boston's conjecture on pro-p groups.
Established new criteria for rigidity of weakly branch actions.
Connected Hausdorff dimension with action rigidity.
Abstract
We disprove a well-known conjecture of Boston (2000), which claims that a just-infinite pro- group is branch if and only if it admits a positive-dimensional embedding in the group of -adic automorphisms. This is obtained as a result of a comprehensive study of the rigidity of branch actions. Firstly, we generalize the notion of the structure graph, introduced by Wilson in 2000, to weakly branch groups and use it to prove several results on the first-order theory of weakly branch groups, extending previous results of Wilson on branch groups. Secondly, we completely characterize the rigidity of weakly branch and branch actions on arbitrary spherically homogeneous rooted trees, extending previous partial results (for branch actions) by Hardy, Garrido, Grigorchuk and Wilson. Moreover, we prove that rigidity of a weakly branch group is equivalent to rigidity of its closure in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
