Waldek,
This is great, thank you for this.
I have a patch here to add to this code:
https://github.com/martinbaker/fricasAlgTop/blob/master/gpresent7.patch
or full code is here:
https://github.com/martinbaker/fricasAlgTop/blob/master/gpresent.spad
The patch does the following:
1) I have taken the liberty of adding extra comments to your code. I
hope its not to verbose for you.
2) Tidy up the trace print routines, for example, does not display empty
rows.
3) Some minor code additions.
Martin B
On 01/30/2017 05:18 PM, Waldek Hebisch wrote:
I have now commited improved version of Todd-Coxeter. It now
handles coincidencies and is much faster than previus version.
Scaling is not great, but much better than before: I was able
to do enumeration for Mathieu 11 (using second presentation from
Canon et all paper) in 211 seconds.
Currently coincidencies are handled using union-find and
table of equivalents. It seems that we could handle them
more directly by careful updating of coset table. But
that is potentially error-prone so I am using simpler
implementation now.
Coset with respect to a subgroup are still to do.
AFAICS still quite a lot of work goes into redundant
scanning of coset table. We probably could get large
speedup by having some kind of agenda with current work,
so that after adding a point we could quickly
restart work waiting for this point.
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
