Amenability of linear-activity automaton groups

Details Amenability of linear-activity automaton groups Amenability of linear-activity automaton groups

2009-05-13

arxiv.org/abs/0905.2007v2

Mathematics

Group Theory

29 pages, 1 figure. Revised version after referee report. To appear in the Journal of the European Mathematical Society

Scientific paper

We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group -- the mother group -- has asymptotic entropy 0. Our result answers an open question by Nekrashevich in the Kourovka notebook, and gives a partial answer to a question of Sidki.

Affiliated with

Also associated with

No associations

Rating

Amenability of linear-activity automaton groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Amenability of linear-activity automaton groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Amenability of linear-activity automaton groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128563