1984
DOI: 10.1007/bf01246117
|View full text |Cite
|
Sign up to set email alerts
|

Generators for AutG, G free nilpotent

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

1992
1992
2016
2016

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…We remark that in 1984, Andreadakis [2] showed that Aut N n,k is generated by P , Q, S, U and k − 2 other elements for n ≥ k ≥ 2. No presentation for Aut N n,k is known except for Aut N 2,k for k = 1, 2 and 3 due to Lin [34].…”
Section: Twisted Cohomology Groupsmentioning
confidence: 95%
See 1 more Smart Citation
“…We remark that in 1984, Andreadakis [2] showed that Aut N n,k is generated by P , Q, S, U and k − 2 other elements for n ≥ k ≥ 2. No presentation for Aut N n,k is known except for Aut N 2,k for k = 1, 2 and 3 due to Lin [34].…”
Section: Twisted Cohomology Groupsmentioning
confidence: 95%
“…Andreadakis [1] calculated the images of the Magnus generators of IA n by the first Johnson homomorphism as 2) and showed that τ 1 is surjective.…”
Section: τmentioning
confidence: 99%
“…For k ≥ 3, Goryaga [15] showed that Aut N n,k is finitely generated for n ≥ 3 · 2 k−2 + k and k ≥ 2. In 1984, Andreadakis [2] showed that Aut N n,k is generated by P , Q, S, U and the other k − 2 elements for n ≥ k ≥ 2. In this paper, we use the following Bryant and Gupta's result.…”
Section: Automorphism Group Of a Free Nilpotent Groupmentioning
confidence: 99%
“…Using the tame automorphism, it is routine to verify that Andreadakis [5], reduced the restriction on n by proving that the same conclusion holds for n/> I. C. K. Gupta and Bryant [31] eliminated all but one ®k by proving that if n >~ l Aut F., l = (T.,~, 03).…”
Section: Automorphisms Of Solvable Groupsmentioning
confidence: 99%