Most actions on regular trees are almost free
Group Theory
2008-10-10 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.0810.1731,
title = {Most actions on regular trees are almost free},
author = {Miklos Abert and Yair Glasner},
journal= {arXiv preprint arXiv:0810.1731},
year = {2008}
}
Comments
16 pages, one figure, to appear in GGD