I wrote:
>
> Given that I know how presentation of permutation
> group can be dane and that I know structure of
> PermutationGroup I decide to code the convertion.
> I need to do more test, but at least S5 seem to
> work correctly.
I hav now commited the code, there are two new functions:
relationsInStrongGenerators which gives defining relations
between stong generators and relationsInGenerators which
gives defining relations between original generators.
Testing this with Todd-Coxeter is problematic: new code
can handle pretty large groups, but may produce bloated
presentation so that Todd-Coxeter takes forever to
handle it. With original generators already S4 is
problematic and even D3 works only after applying
'simplify'. Using strong generators works better,
S5 works, but A6 (and S6) apparently are too hard
for Todd-Coxeter. At first I hoped that Mathieu 11
could work as it has only few thousends elements,
but we probably first should look at smaller groups...
--
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.
