Improving Character Table Computation

[aidevnn]

The current implementation for computing character tables is based solely on the following methods:

• Lifting from the derived subgroup
• Induction from subgroups
• Restriction from the supergroup, as in the case of SL(2,3)

This implementation can be enhanced by incorporating various named characters and resolving orthogonality and an old implementation for resolving orthogonality can be retrieved from git-history.

[aidevnn]

When dealing with the character table, some small improvement can be tested

• the regular character to complete the last line,
• an induction from the stabilizer subgroup corresponding to each class,
• additionally, if the stabilizer subgroup is normal, lifting can also be done.

[aidevnn]

In the case of abelian group, induction from its subgroups is x3 slower than direct computation of linear characters from tensor property.

https://github.com/aidevnn/FastGoat/blob/b44c8445099c40948a09e8efc71af65b78d4c340/FastGoat/Examples/AllGroupsUptoOrder32.cs#L42-L49

It is now fixed.

https://github.com/aidevnn/FastGoat/blob/982a0a0473200385aee79f75589a826308cc1d44/FastGoat/Examples/AllGroupsUptoOrder32.cs#L40-L53

[aidevnn]

When linear characters are associated with a new character with unknowns, it is possible to reduce and solve the system for SL(2,3), GL(2,3), SL(2,3) x C2, and SL(2,3) x: C2. However, a method to avoid unnecessary linear characters still needs to be found.

[aidevnn]

Pretty print error needs to be fixed, I^2 = -1.

https://github.com/aidevnn/FastGoat/blob/8b55d92ec6e9fb3f3391e21940988e7bd3e91a67/FastGoat/DetailsGroupsUptoOrder32.txt#L6116-L6119