-
-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Improving Character Table Computation #60
Comments
When dealing with the character table, some small improvement can be tested
|
In the case of abelian group, induction from its subgroups is x3 slower than direct computation of linear characters from tensor property. FastGoat/FastGoat/Examples/AllGroupsUptoOrder32.cs Lines 42 to 49 in b44c844
It is now fixed. FastGoat/FastGoat/Examples/AllGroupsUptoOrder32.cs Lines 40 to 53 in 982a0a0
|
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. |
Pretty print error needs to be fixed, I^2 = -1. FastGoat/FastGoat/DetailsGroupsUptoOrder32.txt Lines 6116 to 6119 in 8b55d92
|
The current implementation for computing character tables is based solely on the following methods:
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.
The text was updated successfully, but these errors were encountered: