The Whitehead Algorithm for free groups (PDF)
(Sprache: Englisch)
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...
sofort als Download lieferbar
eBook (pdf)
Fr. 16.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „The Whitehead Algorithm for free groups (PDF)“
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.
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.
Bibliographische Angaben
- Autor: Chimere Anabanti
- 2015, 1. Auflage, 47 Seiten, Englisch
- Verlag: GRIN Verlag
- ISBN-10: 3656922667
- ISBN-13: 9783656922667
- Erscheinungsdatum: 18.03.2015
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 0.59 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "The Whitehead Algorithm for free groups"
0 Gebrauchte Artikel zu „The Whitehead Algorithm for free groups“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "The Whitehead Algorithm for free groups".
Kommentar verfassen