Computing the character table of a finite group

@article{Unger2006ComputingTC,
  title={Computing the character table of a finite group},
  author={William R. Unger},
  journal={J. Symb. Comput.},
  year={2006},
  volume={41},
  pages={847-862}
}
Brauer’s theorem on induced characters is an invitation to an algorithm for computing the character table of a finite group. We describe an implementation of such an algorithm and report on its performance. The main ingredients of the algorithm are Brauer’s theorem, and lattice reduction by LLL. We report on the performance of the algorithm in computing character tables of various groups, including local subgroups of 3Fi24 and maximal subgroups of the Monster. We find that for many interesting… CONTINUE READING
9 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

The Theory of Groups of Finite Order, 2nd ed

  • W. Burnside
  • J. Algebra (in press)
  • 1955
Highly Influential
6 Excerpts

Fischer – Clifford matrices and character table of the group 27 : Sp 6 ( 2 )

  • F. Ali, J. Moori
  • Int . J . Math . Game Theory Algebra
  • 2004
1 Excerpt

Fischer–Clifford matrices and character table of the group

  • J. Moori
  • Represent. Theory
  • 2004
2 Excerpts

The character values of the irreducible constituents of a transitive permutation

  • G. O. Michler, M. Weller
  • 2002
2 Excerpts

The character values of the irreducible constituents of a transitive permutation representation

  • G. O. Michler, M. Weller
  • Arch . Math .
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…