The elementary amenability conjecture for generalized basilica groups

About 9 years old · traced to

Let XX be a finite set, let X∗X^* be the rooted tree given by the free monoid on XX, and let G≤Aut⁡(X∗)G\leq\operatorname{Aut}(X^*) be a generalized basilica group: namely, GG admits a finite generating set YY such that for every g∈Yg\in Y either gx=1g_x=1 for all x∈Xx\in X, or gx∈{1,g}g_x\in\{1,g\} for all x∈Xx\in X, with exactly one xx such that gx=gg_x=g. Here gxg_x denotes the section of gg at xx. The elementary amenability conjecture for generalized basilica groups. Every generalized basilica group is either (locally finite)-by-(virtually abelian) or not elementary amenable. The theorem in the paper proves this dichotomy for balanced generalized basilica groups, while the conjecture extends it to all generalized basilica groups.

References

Primary source

Kate Juschenko, Benjamin Steinberg and Phillip Wesolek, “On elementary amenable bounded automata groups”, arXiv:1712.08418 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.