2000 character limit reached
Non-elementary amenable subgroups of automata groups
Published 2 Apr 2015 in math.GR | (1504.00610v1)
Abstract: We consider groups of automorphisms of locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. This covers all known examples of groups that are not elementary amenable and act on the trees: groups of intermediate growths and Basilica group, by giving a more straightforward proof. Moreover, we deduce that all finitely generated branch groups are not elementary amenable, which was conjectured by Grigorchuk.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.