Rescuing the Whitehead method for free products. I: Peak reduction (Q792452): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3337638 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rescuing the Whitehead method for free products. II: The algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5779204 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5779205 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of Elements Under Automorphisms of a Free Group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4145882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On free groups and their automorphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Certain Sets of Elements in a Free Group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On equivalent sets of elements in a free group / rank | |||
Normal rank |
Latest revision as of 12:36, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rescuing the Whitehead method for free products. I: Peak reduction |
scientific article |
Statements
Rescuing the Whitehead method for free products. I: Peak reduction (English)
0 references
1984
0 references
For a free group F of finite rank J. H. C. Whitehead proved in 1936 a theorem which gives an algorithm which enables one to decide for any two given elements of F whether or not there is an automorphism of F that carries one element to the other. In the present paper the authors consider the analogous problem in a free product of a finite number of (freely indecomposable) groups. For a given free product G they define a set of generators \(\Omega\) for the automorphism group of G which plays the role of the set of Whitehead automorphisms for the free group. Despite the fact that \(\Omega\) is now an infinite set they can decide for a given cyclic word u whether there exists \(p\in \Omega\) such that up is shorter than u. They complete the procedure of deciding when two elements of G lie in the same automorphism class under the hypothesis that the factors of G which are not infinite cyclic are finite and deal with the general case in a subsequent paper [Part II, ibid. 186, 335-361 (1984)].
0 references
free product
0 references
generators
0 references
automorphism group
0 references
Whitehead automorphisms
0 references
automorphism class
0 references