Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Whitehead's Algorithm"”.

  1. Free groups and Stallings' folding

    … to uncover a fine property of the classical Whitehead's algorithm for recognizing primitive elements and free factors in a free group. This property is then used to the study of the complex of free factors, a crucial object on which Out(F_n) acts. We also make use of these techniques to …

    oxford Repository record for Free groups and Stallings' folding (opens in a new tab)

  2. Whitehead's Decision Problems for Automorphisms of Free Group

    … of finite rank. Given words u, v ∈ F, J.H.C. Whitehead solved the decision problem of finding an automorphism φ ∈ Aut(F), carrying u to v. He used topological methods to produce an algorithm. Higgins and Lyndon gave a very concise proof of the problem based on the works of Rapaport. We provide …

    mcmaster Repository record for Whitehead's Decision Problems for Automorphisms of Free Group (opens in a new tab)