English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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