On 2018-03-20 16:44, Dima Pasechnik wrote:
I do not know how efficiently relative extensions of Q[i] are implemented. I would not mind an absolute field. I need things like computing resultants and factoring univariate polynomials to work not too slowly.
Over a field of degree 1152, that is probably out of the question.
I did some Groebner basis computation that gave me what I suspect is an superfield of what I need, and it is of degree 32 over Q, with really huge coefs....
I guess that one could use some group theory to find out all degree 32 subfields of the Galois closure without actually computing the Galois closure. I'm not sure if this has been implemented somewhere.
-- 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 email to [email protected]. Visit this group at https://groups.google.com/group/sage-nt. For more options, visit https://groups.google.com/d/optout.
