We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
sgn
Permutation
For instance, when we want to compute the sign of an Permutation object, we convert it to a CycleDecomposition and then we compute the sign.
CycleDecomposition
Perhaps is better to compute the sign directly by counting the number of inversions, i.e., using the base definition of sign.
To implement that we need #25 .
The text was updated successfully, but these errors were encountered:
sng()
degree()
VascoSch92
Successfully merging a pull request may close this issue.
For instance, when we want to compute the sign of an
Permutation
object, we convert it to aCycleDecomposition
and thenwe compute the sign.
Perhaps is better to compute the sign directly by counting the number of inversions, i.e., using the base definition of sign.
To implement that we need #25 .
The text was updated successfully, but these errors were encountered: