2016
DOI: 10.4310/mrl.2016.v23.n1.a8
|View full text |Cite
|
Sign up to set email alerts
|

On the number of outer automorphisms of the automorphism group of a right-angled Artin group

Abstract: We show that for any natural number N there exists a right-angled Artin group A Γ for which Out(Aut(A Γ )) has order at least N . This is in contrast with the cases where A Γ is free or free abelian: for all n, Dyer-Formanek and Bridson-Vogtmann showed that Out(Aut(F n )) = 1, while Hua-Reiner showed |Out(Aut(Z n ))| ≤ 4. We also prove the analogous theorem for Out(Out(A Γ )). These theorems fit into a wider context of algebraic rigidity results in geometric group theory. We establish our results by giving exp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 20 publications
0
10
0
Order By: Relevance
“…The description of the automorphism group of a direct product of RAAGs is due to N. Fullarton [10], and G. Giovanni and N. Wahl [11], whose results we present in this section, together with its implications for the R ∞ -property for RAAGs. Recall that a direct product on group theoretical level corresponds to a simplicial join on graph theoretical level.…”
Section: Automorphism Group Of Direct Product Of Raagsmentioning
confidence: 94%
“…The description of the automorphism group of a direct product of RAAGs is due to N. Fullarton [10], and G. Giovanni and N. Wahl [11], whose results we present in this section, together with its implications for the R ∞ -property for RAAGs. Recall that a direct product on group theoretical level corresponds to a simplicial join on graph theoretical level.…”
Section: Automorphism Group Of Direct Product Of Raagsmentioning
confidence: 94%
“…The above results indicate that both Out(Aut(A Γ )) and Out(Out(A Γ )) are either small or trivial for A Γ = Z n and A Γ = F n , independent of n. For more general RAAGs, the second author has shown in [5] that this behavior does not hold. More precisely, he proves that for any n > 0 there exist graphs Γ 1 , Γ 2 so that | Out(Aut(A Γ 1 ))| > n, and | Out(Out(A Γ 2 ))| > n. Theorem A of this paper substantially strengthens the second author's result in the case of Out(Out(A Γ )).…”
Section: Introductionmentioning
confidence: 93%
“…The second author [5] also introduced the notion of an austere graph. If Γ is austere, then Out(A Γ ) is, in some sense, as simple as possible.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) (graph automorphisms) automorphisms of the graph Γ via a permutation of its set of vertices V , The next proposition builds on the work of Fullarton [5] to show how automorphisms of RAAGs interact with the direct product decomposition of a RAAG.…”
Section: Corollary 32mentioning
confidence: 99%