Abstract
For a finitely generated group the Nielsen graph , , describes the action of the group of automorphisms of the free group on generating -tuples of G by elementary Nielsen moves. The question of (non)amenability of Nielsen graphs is of particular interest in relation with the open question about Property for , . We prove nonamenability of Nielsen graphs for all when is indicable, and for big enough when is elementary amenable. We give an explicit description of for relatively free (in some variety) groups of rank and discuss their connectedness and nonamenability. Examples considered include free polynilpotent groups and free Burnside groups.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.