Texas A&M University, Department of
Mathematics, 216 Milner Hall, 21st of April 2004, 3:00-4:00
Groups and Dynamcs Seminar
The group of
automata of polynomial growth
Said Sidki of University of Brasilia
Automorphisms of one-rooted regular trees corresponding to finite
input-output automata with polynomial growth form a group denoted by Pol. Many important examples
of groups with extremal properties such as being just-infinite or
just-nonsolvable are subgroups of Pol.
We will give a proof of our recent result that Pol does not contain free subgroups
of rank 2 and discuss other aspects of this group.