MA61041: Computational Algebra
| MA61041 | |
|---|---|
| Course name | Computational Algebra |
| Offered by | Mathematics |
| Credits | 4 |
| L-T-P | 3-1-0 |
| Previous Year Grade Distribution | |
| {{{grades}}} | |
| Semester | {{{semester}}} |
Syllabus
Syllabus mentioned in ERP
Pre requisite: Modern AlgebraInvestigations of groups on computers, coset enumeration, some examples using coset enumeration, defining relations for subgroups of finite index of groups with finite presentation, Nielsen transformations, calculation with the elements of a finite group given by generators and defining relations. Algorithms and programs for the determination of the automorphism group of a finite group, a computational method for determining the automorphism group of a finite solvable group, combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups, construction of the character table of a finite group from generators and relations, program for calculation of characters and representations of finite groups, program for the drawing of the lattices. Computer algebra programs, GAP. Calculations in rings group rings and Lie algebras.