Thank you. This is indeed useful. To summarize I am now doing something like
R.<a>=SR[] K.<p1,p2>=R[] f = K(a*p1+p2) which is fast also when the expression a*p1+p2 becomes very lengthy. It leaves me with the problem that f is no longer an expression of the original type P (P.<p1,p2>=SR[]) which seems to cause issues later on. I'll try to convert f to P. If you have a suggestion I would be grateful. -- 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?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
