On amenability of automata groups

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1215/00127094-2010-046

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On amenability of automata 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 On amenability of automata groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On amenability of automata groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-647793

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.