Suppose I have an algorithm that works over univariate polynomials and can be recursively applied to its coefficients which may be themselves univariate polynomials over univariate polynomials ... over some base ring like QQ. It probably makes sense to assume that the input polynomial is given exactly in such a recursive format.
Before I start writing a wrapper routine that turns any polynomial into such a recursive form, I'd like to ask whether such a routine perhaps already exists. Input should be a polynomial in any form, for example living in Q[x,y,z][u,v][a][s,t] should be transformed into the "same" polynomial living in Q[x][y][z][u][v][a][s][t] (of course, creating that very recursive polynomial ring during the coercion). I hope, it's somehow clear what I mean. Thank you in advance. Ralf -- You received this message because you are subscribed to the Google Groups "sage-support" 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 http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
