On 2012-12-20, Anton Sherwood wrote:
> I have a project in mind that involves the symmetry groups of the
> regular four-dimensional polytopes.
> I'm told that enumeration of a group from its generators is a
> by-product of the Todd-Coxeter algorithm.
> Unfortunately, I can't make sense of Wikipedi
sage: polytope = polytopes.n_cube(4)
sage: G = polytope.restricted_automorphism_group(); G
Permutation Group with generators [(5,9)(6,10)(7,11)(8,12),
(3,5)(4,6)(11,13)(12,14), (2,3)(6,7)(10,11)(14,15),
(2,5)(3,9)(4,13)(7,10)(8,14)(12,15),
(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(13,14)(15,16),
(1,16)
Okay, sage.groups.matrix_gps.matrix_group.MatrixGroup() appears to be
what I need. Thanks for the keyword!
--
*\\* Anton Sherwood *\\* www.bendwavy.org
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage
