On 11/23/10 10:46 AM, javier wrote
I don't know if I'd call it "easy" but one thing you can do is to
transform your group to a permutation group and the translate that
into sage:
sage: gg = gap.AllSmallGroups(60)
sage: gg1 = gg[1]
sage: iso = gg1.IsomorphismPermGroup()
sage: gg2 = iso.Image()
sage: gens = gg2.GeneratorsSmallest()
sage: G1 = PermutationGroup(gens)
sage: type(G1)
<class
'sage.groups.perm_gps.permgroup.PermutationGroup_generic_with_category'>
sage: G1.order()
60
this can be useful for small groups, but I am afraid it would be
terribly inefficient for large ones. A better way would be
implementing general groups with generators and relations in sage, but
I don't know if any work has been done along these lines.
Thanks Simon and Javier. I was able to do what I wanted to do based on
your tips.
Jason
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
