You should also think about what algorithms you want to implement. There
is for example the Todd-Coxeter algorithm for enumerating cosets, and
the Schreier-Sims algorithm for computing strong generating sets of
permutation groups (this is useful because it immediately tells you the
order, allows fast testing for group membership, and much more). Then
there are more specialised algorithms for e.g. enumerating transitive
subgroups of S_n up to conjugation.
Basically: there is a huge number of algorithms out there. You need to
understand what you want to implement, and what the algorithms you are
interested in depend on. Any book on computational group theory is a
good starting point...
On 28.03.2012 09:52, Rhythm Gupta wrote:
Hello,
Perhaps, at school/university, you like (or liked) some of the
mathematics-related subjects more? You may also start thinking about
how to implement certain tasks; this may help you form an attitude
towards the tasks and prioritise them according to your preference.
Thanks Sergiu,this worked and I'm now thinking of implementing "Group
theory" as a module.
I also coded some basic group properties in Java. :-) So i'm pretty
comfortable with it.
Also i'm currently pursuing a course based on the same principles.
Will post about various ways of representing and implementing it soon.
Thanks
Rhythm gupta
--
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.
--
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.
