Amenability of bounded automata groups on infinite alphabets

DOI10.1112/BLMS.13065zbMATH Open1543.2003MaRDI QIDQ6570072FDOQ6570072

Authors: Bernhard Reinke 

Publication date: 10 July 2024

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

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

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)

Cites Work

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

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)