Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-elementary amenable subgroups of automata groups (1504.00610v1)

Published 2 Apr 2015 in math.GR

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.

Summary

We haven't generated a summary for this paper yet.