Hi Jeroen, PARI now (as of somewhere in the 2.8 development branch) has a nfsplitting() function to find the splitting field of a polynomial over QQ (i.e. the Galois closure of an absolute number field). It does not yet exist for relative number fields, as far as I can see.
What exactly do you mean by "factoring as a generator function"? I am also going to the PARI workshop and am planning to try to understand the modular symbols functionality. I am mostly interested in this for its own sake, but it would also be interesting to wrap this code in Sage as an alternative to the existing Sage implementation of modular symbols. Apart from that, I want to try to improve linear algebra (mostly over finite fields) in PARI. Not sure if this is immediately useful for Sage, but it could be. Peter Op dinsdag 6 januari 2015 18:19:08 UTC+1 schreef Jeroen Demeyer: > > Hello, > > I will go the PARI workshop in Bordeaux next week and I will give a talk > about "PARI and Sage". The PARI developers in particular want to know if > Sage has any requests for PARI, things that we would like to be > implemented in PARI. > > I can think of: > > * Porting Simon's 2-descent scripts to PARI > * Splitting field/Galois closure (I have implemented this in Sage, but a > native PARI implementation would make sense) > * polgalois() in higher degrees; relative polgalois() > * Factoring as generator function > -- You received this message because you are subscribed to the Google Groups "sage-nt" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send an email to [email protected]. Visit this group at http://groups.google.com/group/sage-nt. For more options, visit https://groups.google.com/d/optout.
