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
Bug in IncidenceStructure.automorphism_group when the ground set consists of pairs #16741
Comments
Branch: u/ncohen/16741 |
comment:1
This really was triky to fix. The permutation code tries to handle several incompatible input i.e. tries to guess whether input is given in list notation or cycle notation, and guesses that from the type list/tuple of input. Plus some permutation code WANTS permutations on 1...n, others on 0,...,n-1 and others handle everything... |
This comment has been minimized.
This comment has been minimized.
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
when I read the permgroups code, I think: "FORTRAN" :-) |
comment:5
LGTM |
comment:6
Thaaaaaaaannks ! Nathann |
comment:7
name |
Reviewer: Dima Pasechnik |
Changed branch from u/ncohen/16741 to |
comment:10
PDF docs:
|
Changed commit from |
comment:11
wrong ticket |
Before
After
CC: @videlec @KPanComputes @dimpase
Component: combinatorial designs
Author: Nathann Cohen
Branch:
aad8ee5
Reviewer: Dima Pasechnik
Issue created by migration from https://trac.sagemath.org/ticket/16741
The text was updated successfully, but these errors were encountered: