Wilf Wilson
Wilf Wilson
This is a follow-on pull request #4050, although it doesn't require that PR. I describe the changes below, but as mentioned below, this PR will break the tests of some...
Should `Blocks` work for intransitive groups? Currently, it is documented to only work for transitive actions (understandably). If not, what should be the behaviour of `Blocks` given an intransitive group?...
`ListPerm` is a global function that doesn't validate its arguments. When given input that is valid (according to its documentation), it behaves fine. Unfortunately people don't always give valid input,...
It's very easy for changes to the GAPDoc code to introduce slight problems into the compilation of the manual. Currently, I think our CI only catches problems with the manuals...
I don't think it is sufficiently easy to find out which of the four main digraph encoding formats apply to which kinds of digraphs. I'm talking about `(di)sparse6` and `(di)graph6`....
This would do the same thing as the usual `on: push` and `on: pr` workflows, except that instead of using the checkout of Digraphs corresponding to the pushed branch or...
See https://en.wikipedia.org/wiki/Cograph#Other_characterizations for several equivalent definitions. The simplest seems to be 'graph (i.e. symmetric digraph) that doesn't contain the 4-vertex path graph as a subgraph'. I don't know how hard...
Currently we `malloc` and blithely assume that it succeeds. Usually it does (at least on 64-bit), but it doesn't necessarily succeed, and it is more likely to fail on 32-bit...
...particularly in the Schreier-Sims implementation. @ChrisJefferson reported in https://github.com/semigroups/Semigroups/issues/634#issuecomment-790661632 that when using the homomorphism finder for the first time, Digraphs allocates 1.25 GB of memory, and that moreover, this memory...
https://en.wikipedia.org/wiki/Distance-transitive_graph