Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 185

Preprint Number 185

Previous Next Preprint server

185. Jakub Gismatullin
Boundedly simple groups of automorphisms of trees

Submission date: 15 May 2009.


A group is boundedly simple if for some constant N, every nontrivial conjugacy class generates the whole group in N steps (bounded simplicity implies simplicity). For a large class of colored trees, Tits proved simplicity of automorphism groups generated by stabilizers of edges. We determine for which colored trees such groups are boundedly simple. Namely, for (almost) bi-regular trees they are 32-boundedly simple. For all other colored trees in the class, such groups are not boundedly simple.

Mathematics Subject Classification: Primary 20E08, 20E32; Secondary 05C05, 20E45

Keywords and phrases:

Full text arXiv: pdf, ps.

Last updated: May 20 2009 13:19 Please send your corrections to: