2017Journal of Topology and AnalysisOpen access

Non-elementary amenable subgroups of automata groups

Kate Juschenko

Open full text 2 citations

Abstract

We consider groups of automorphisms of rooted locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. We give a unified proof for all known examples of non-elementary amenable groups that act on the trees: groups of intermediate growths and Basilica group. Moreover, we show that all finitely generated branch groups are not elementary amenable, which was conjectured by Grigorchuk.

Open-access reader

About this research paper

What this paper is about

We consider groups of automorphisms of rooted locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. We give a unified proof for all known examples of non-elementary amenable groups that act on the trees: groups of intermediate growths and Basilica group. Moreover, we show that all finitely generated branch groups are not elementary amenable, which was conjectured by Grigorchuk.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider groups of automorphisms of rooted locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. We give a unified proof for all known examples of non-elementary amenable groups that act on the trees: groups of intermediate growths and Basilica group. Moreover, we show that all finitely generated branch groups are not elementary amenable, which was conjectured by Grigorchuk.

Key concepts: Automorphism, Elementary proof, Mathematics, Automaton, Finitely-generated abelian group, Group (periodic table), Automorphism group, Pure mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Non-elementary amenable subgroups of automata groups — Research Paper | ScholarLens