Great.
With regard to a next release I took a quick glance at the Schreier-Sims
algorithm:
http://www.maths.usyd.edu.au/u/murray/research/essay.pdf
(pages 25,30,34)
of which I thought it's less memory greedy. On page 35 there's described a
Todd-Coxeter Schreier-Sims algorithm which surpsingly
ATM there is hardcoded limit in the 'toPermutationIfCan'.
> After increasing it (to say 1000) I get:
>
> (19) -> mennicke(4)
>finished using 449875
>
>(19) 36864
> Type:
> PositiveInteger
>
Kurt Pagani wrote:
>
> Amazing ;)
> The stakes are high now.
>
> I've tried the Men(n) function (Mennicke) from the Intro:
>
> )co permgrps
> )co gpresent
> )set mess time on
>
> -- Mennicke Men(n) from
> -- Implementation and Analysis of the Todd-Coxeter Algorithm
> -- By John J. Cannon, Luc
> Current (trunk with small improvenents):
>
> m11 w 182.19 using 14830 cosets
>
> HLT style:
>
> m11 w 0.12 sec using 47966 cosets
>
Amazing ;)
The stakes are high now.
I've tried the Men(n) function (Mennicke) from the Intro:
)co permgrps
)co gpresent
)set mess time on
-- Mennicke Men
