The Whitehead Algorithm for free groups

Lieferzeit: Lieferbar innerhalb 14 Tagen

15,99 

ISBN: 3656922675
ISBN 13: 9783656922674
Autor: Anabanti, Chimere
Verlag: GRIN Verlag
Umfang: 52 S.
Erscheinungsdatum: 20.03.2015
Auflage: 1/2015
Format: 0.5 x 21 x 14.8
Gewicht: 90 g
Produktform: Kartoniert
Einband: Kartoniert
Artikelnummer: 8009381 Kategorie:

Beschreibung

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 Nielsens 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 Whiteheads 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.

Herstellerkennzeichnung:


GRIN Publishing GmbH
Waltherstraße 23
80337 München
DE

E-Mail: info@grin.com

Das könnte Ihnen auch gefallen …