On Mar 20, 1:36 pm, David Joyner <[email protected]> wrote:
> This seems good. It sounds like you plan on implementing
> permutation groups, and the methods you describe, which the
> user defines using a list of (permutation) generators.
> Is that your question?
Well I was thinking about a more abstract presentation using symbolic
generators and relations. For example, the cyclic group Cn is
generated by a single element {s} (set of generators) such that
{s^n=id} (set of relations); the dihedral group Dn is generated by
{r,s} such that {r^n=id, s^2=id, srs=r^{-1}} and so on to more
complicated stuff. The so-called "word problem" that determines
whether two words in the generators are in fact the same element of
the group is not solvable for finitely presented groups, but *is*
solvable for finite groups and some other classes of groups (http://
en.wikipedia.org/wiki/Word_problem_for_groups). The book ("Handbook of
computational group theory") provides algorithms for going from this
presentation to a permutation presentation.
My question was whether what I described would be an appropriate, good-
sympy-practice way to implement group objects - or at least start
implementing them :)
Alex
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
