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.
--
Waldek Hebisch
--
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.
