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
PermutationGroup.cardinality is sometimes an int #23778
Comments
Commit: |
New commits:
|
Branch: u/vdelecroix/23778 |
comment:2
Did you also check to see how cycle_tuples = []
for g in gens:
temp = g.cycle_tuples()
if len(temp) != 2:
return None
cycle_tuples.append(temp) compares timing-wise? At least it seems like it would be faster... |
comment:3
I don't believe that |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Reviewer: Travis Scrimshaw |
comment:5
One failing test according to the patchbot:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:8
Indeed... the source code had changed. |
comment:9
Fixed! |
comment:11
Thanks. |
Changed branch from u/vdelecroix/23778 to |
This prevents using the
.is_one()
method or any otherInteger
specific method.The problem comes from the shortcuts implemented in the
_order
method.Component: group theory
Author: Vincent Delecroix
Branch/Commit:
e9795a0
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/23778
The text was updated successfully, but these errors were encountered: