The Whitehead Algorithm for free groups

ebook

By Chimere Anabanti

cover image of The Whitehead Algorithm for free groups

Sign up to save your library

With an OverDrive account, you can save your favorite libraries for at-a-glance information about availability. Find out more about OverDrive accounts.

   Not today
Libby_app_icon.svg

Find this title in Libby, the library reading app by OverDrive.

app-store-button-en.svg play-store-badge-en.svg
LibbyDevices.png

Search for a digital library with this title

Title found at these libraries:

Loading...
Master's Thesis from the year 2013 in the subject Mathematics - Algebra, grade: -, University of Warwick (Institute of Mathematics), course: M.Sc dissertation in Pure Mathematics, language: English, abstract: We start with a brief introduction to Free Groups, thereby appreciating Nielsen's approach to the Subgroup theorem. Beautiful results of J. H. C. Whitehead, J. Nielsen, E. S. Rapaport, Higgins and Lyndon, and J. McCool form our building block. We study different automorphisms of a finitely generated free group as well as a finite set of automorphisms which Whitehead used to deduce that if two elements of a finitely generated free group are equivalent under an automorphism of the group, then they are equivalent under such automorphisms. We write program aimed at appreciating Whitehead's theorem, starting with programs for appreciating Whitehead automorphisms to programs for determining whether two elements of a finitely generated free group are equivalent or not. We conclude by classifying all minimal words of lengths 2, 3, 4, 5 and 6 in F n (for some n ∈ [2, 6]) up to equivalence.
The Whitehead Algorithm for free groups