Most actions on regular trees are almost free
classification
🧮 math.GR
math.CO
keywords
almostgroupactionsautomorphismd-regularelementelementsevery
read the original abstract
Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.