Most actions on regular trees are almost free

Simple item page
dc.creatorAbert, Miklos
dc.creatorGlasner, Yair
dc.date2008-10-09
dc.date.accessioned2026-07-07T10:08:49Z
dc.date.available2026-07-07T10:08:49Z
dc.descriptionLet 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.
dc.description16 pages, one figure, to appear in GGD
dc.identifierhttps://arxiv.org/abs/0810.1731
dc.identifierhttp://arxiv.org/abs/0810.1731
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171127
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.subject20E08; 05C05; 20P05
dc.titleMost actions on regular trees are almost free
dc.typetext

Files

Collections

arXiv