On Mar 20, 12:32 am, Saptarshi Mandal <sapta.iit...@gmail.com> wrote: > The notes for a graduate course at Colorado State are also very > interesting. I referred to them for implementing some of the more > elementary algorithms. > > http://www.math.colostate.edu/~hulpke/CGT/CGT.html
Thanks for the reference! I started reading the Handbook of Computational Group Theory and it seems like a solid reference. So do you guys think it'd be a good idea to build a group theory module for sympy for a possible GSoC? By that I mean, do you find it interesting and in the scope of the project? If so, I'm willing to try to come up with a proposal after going over the book and the other references. Also, how do you think groups should be implemented? I've been thinking about making a group class that inherits Basic and has properties like is_finite, is_abelian, is_cyclic, is_simple, and so on... , and list the different possibilities for presenting a group as properties as well - permutation_form, generators_form, ... and maybe have methods for going from one to another; also have methods like subgroup(), normal_subgroup(),... and so on. This is probably rather naive at such an early point, but it seems abstract enough to allow flexibility in the future. I guess it was inspired by the Permutation class. Is this a good practice? Also, the tiny little functionality covering Galois groups for polynomials of degree less than 5 should come out soon, but for that I first need some basic Group object to work with, hence my above question. -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
