-
Notifications
You must be signed in to change notification settings - Fork 8
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
Symplectic C6 #74
Symplectic C6 #74
Conversation
Codecov Report
@@ Coverage Diff @@
## main #74 +/- ##
==========================================
- Coverage 93.64% 92.26% -1.39%
==========================================
Files 14 14
Lines 2141 2223 +82
==========================================
+ Hits 2005 2051 +46
- Misses 136 172 +36
|
Is the error in recog you are alluding to the same as gap-packages/recog#295 ? |
# According to the Magma code, there is no need to take another | ||
# generator instead of U1 if we cannot rescale it to determinant 1 - we | ||
# simply discard U1 as a generator. | ||
# Comparing with the Magma code, we can simply take |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What do you mean here? Are you saying: "The Magma code does this, so we use this as justification for doing the same"? (that doesn't seem like a great argument, by the way ;-).
Or are you saying: "compared to the Magma code, we are better/different/whatever, and hence it suffices to do XYZ?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The former :D ... well, sadly the relevant paper does not really say much (or rather anything) concerning this particular case so I trusted the Magma code on this one - however, doing this did pass some sanity checks: (1) the group sizes do come out the right way and (2) this case is exactly where an exception occurs in the structure of these C6 subgroups according to the tables in [BHR13] (namely, they are a bit smaller), so it makes sense that this should suffice.
One could of course check "theoretically" that these generators are enough, but I am not sure if this maybe transcends our current mathematical horizon a bit ;)
Ummmm, I honestly don't know, but could be ... - the tests just produced a ton of RECOG errors, which we currently handle by simply removing the error-causing tests until there are no errors anymore :D ... sadly, this means that, sometimes, not many tests are left :/ |
I guess I can merge this, @fingolfin? |
That's bad! Please at least turn those into bug reports for recog. Else they won't (can't!!) be fixed |
There is a conflict now, which looks easy to resolve (basically two PRs were appending to the end of |
I've manually resolved the conflict (via the web interface -- nice feature!) Assuming tests pass, we can merge it next. |
Add functions constructing C6 subgroups of Sp(n, q) and a corresponding generic function in the
ClassicalMaximals.gi
Note: Lines not covered by the tests in
ExtraspecialNormalizerMatrixGroups.gi
are exclusively due to problems with RECOG, but I have checked these manually; the changes inClassicalMaximals.gi
will be tested once the symplectic main function is complete and we implement its tests.Checklist for the reviewer
General
Functions constructing generators of maximal subgroups
RECOG.TestGroup
from the recog package.DefaultFieldOfMatrixGroup
returns the correct field.Functions assembling the list of all maximal subgroups of a certain group
The reviewer doesn't need to compare our results to magma's results. That's the job of the person implementing the code.