Amenability of bounded automata groups on infinite alphabets

DOI10.1112/BLMS.13065MaRDI QIDQ6570072zbMATH OpenFDO

Authors Bernhard Reinke

Publication date 10 July 2024

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

growthamenable groupmonodromy groupbounded automata

Mathematics Subject Classification ID

Random walks on graphs (05C81) Groups acting on trees (20E08) Symbolic dynamics (37B10) Means on groups, semigroups, etc.; amenable groups (43A07) Topological groupoids (including differentiable and Lie groupoids) (22A22)

Recommendations

• On amenability of automata groups.
• Amenability of linear-activity automaton groups
• On elementary amenable bounded automata groups
• Extensions of amenable groups by recurrent groupoids
• Full groups of bounded automaton groups

Cites work

• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 2195483 (Why is no real title available?)
• Amenability of discrete groups by examples
• Amenability of linear-activity automaton groups
• Amenability via random walks.
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Combinatorics of polynomials iterations
• Elementary amenable groups
• Extensions of amenable groups by recurrent groupoids
• Finite automata of polynomial growth do not generate a free group.
• Iterated monodromy groups of exponential maps
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• On amenability of automata groups.
• Random Walks on Infinite Graphs and Groups

This page was built for publication: Amenability of bounded automata groups on infinite alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570072)