Permutation Characters in GAP
The purpose of this page is to show applications of the algorithms
to compute possible permutation characters
that are published in the following paper.
Thomas Breuer and Götz Pfeiffer.
Finding Possible Permutation Characters.
J. Symbolic Comput., 26:343--354, 1998.
GAP examples of computing possible permutation characters are
available in DVI format
and in PostScript format.
Any comments about the examples are very welcome.
Messages should be sent to
[GAP Home (Aachen)]
[GAP Home (St Andrews)]
[Multiplicity-Free Permutation Characters]
File created on 06-Oct-2000 by Thomas Breuer.
Last modified on 06-Oct-2000 by Thomas Breuer.