arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0802.2837math.GR
收藏

关于自动机群的顺从性

On amenability of automata groups

Laurent Bartholdi, Vadim A. Kaimanovich, Volodymyr V. Nekrashevych

摘要:

我们证明了一棵有根树的有界自同构群是顺从的,这意味着由有限自动机生成的许多类群是顺从的。证明是基于减少的问题,以显示顺从性只是一个明确的家庭的群体(“母亲组”),这是通过分析的渐近性质的随机游动对这些群体。

英文摘要:

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups ("Mother groups") which is done by analyzing the asymptotic properties of random walks on these groups.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑