Computing possible class fusions from character tables
For many purposes in group theory and representation theory, it is important to know, given a group \(G\) and a subgroup \(H\), which conjugacy classes in \(H\) fuse into which conjugacy classes in \(G\). Usually when solving such a problem by hand, one will use much information from the character tables of \(H\) and \(G\), generally in an ad hoc manner which is difficult to convert into an effective computer algorithm. Moreover, there is a fundamental problem which is often overlooked, namely that the character table does not determine the conjugacy classes in general. The present paper describes efficient algorithms for solving all these problems, to the extent that this is possible using only the character tables and power maps. Moreover, these algorithms are generalised to cases when only partial information is available, as may be the case for example when attempting to compute a character table using induction from subgroups.
- Finding supercharacter theories on character tables
- Fusion in the character table
- Character preclassification based on genetic programming
- scientific article; zbMATH DE number 2125595
- Classification and fusion
- scientific article; zbMATH DE number 2090274
- scientific article; zbMATH DE number 3888537
- Character tables of fission schemes and fusion schemes
- Automated resolving of ambiguities in character classification
This page was built for publication: Computing possible class fusions from character tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254198)
