On 01/25/2017 05:23 AM, Waldek Hebisch wrote:
I also noticed that Todd-Coxeter (toPermutationIfCan)
may produce something strange. Namely, the following
(junky) relations:
Do you think there is a need for a simplifier for PermutationGroup like
this:
http://dracos.co.uk/maths/permutations/
Or does representation in terms of strong generators make this
unnecessary/difficult?
Either way I guess it would be more efficient and scalable if some
simplification could also be done inside the Todd-Coxeter algorithm. I
know that the Todd-Coxeter code does not yet detect and remove
'coincidences', that is, duplicated points. So this in the next
improvement that needs to be made.
Thank you for the useful and interesting information about
PermutationGroup and the algorithms in this and previous posts. I will
work through this and hopefully the code can be improved.
Thanks,
Martin B
--
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.
