On transitivity and (non)amenability of Aut(F_n) actions on group presentations

preprint2014arXivOpen access

Abstract

For a finitely generated group GG the Nielsen graph Nn(G)N_n(G), n≥rank⁡(G)n\geq \operatorname{rank}(G), describes the action of the group Aut⁡Fn\operatorname{Aut}F_n of automorphisms of the free group FnF_n on generating nn-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 (T)(T) for Aut⁡Fn\operatorname{Aut}F_n, n≥4n\geq 4. We prove nonamenability of Nielsen graphs Nn(G)N_n(G) for all n≥max⁡{2,rank⁡(G)}n\ge \max\{2,\operatorname{rank}(G)\} when GG is indicable, and for nn big enough when GG is elementary amenable. We give an explicit description of Nd(G)N_d(G) for relatively free (in some variety) groups of rank dd and discuss their connectedness and nonamenability. Examples considered include free polynilpotent groups and free Burnside groups.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.