On elementary amenable bounded automata groups
pith:JRG2AETN Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{JRG2AETN}
Prints a linked pith:JRG2AETN badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation, we here study elementary amenable bounded automata groups. We are able to isolate the elementary amenable bounded automata groups in three natural subclasses of bounded automata groups. In particular, we show that iterated monodromy groups of post-critically finite polynomials are either virtually abelian or not elementary amenable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.