Hi my name is Alice Liu, I am a third year Maths student at UCL.
I am interested in implementing computation of Galois groups for a given
polynomial, I am wondering if this is enough material for a stand-alone
project?
Also is the desired computation just for the Galois group of the splitting
field of the given polynomial over [image: \mathbb {Q}]; or a more abstract
and more general approach should be taken? Also do I need to aim for
writing codes for the Galois correspondence of associated intermediate
fields?
Also shall I aim to write a patch for the Combinatorics module or any patch
I write would suffice?
Thank you!
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sympy.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/5aa69e5e-7a2b-4868-b4f4-861dc4ff7414%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
