"Implementation of the Todd-Coxeter Algorithm to Finitely Presented Groups"
Presentation of Bachelor thesis
This work presents the notion of free groups and the definition of a group using generators and relations. We use the Todd-Coxeter Algorithm in order to solve the coset enumeration problem for the finitely presented groups: D4, A4, A5, S3, S4, S5, PSL2(7), PSL2(9). Then we use these presentations to prove the exceptional isomorphisms A5=PSL2(5) = SL2(4), PSL2(9) = A6 and SL3(2) = PSL2(7).
Examiner: Victor Ufnarovski
Advisor: Arne Meurman