On 10/1/07, John Cremona <[EMAIL PROTECTED]> wrote: > > This came into the LiDIA mailing list (which I have been on for > years). Would there be a positive response possible from Sage at this > point? >
If "Z_q" below means "GF(p)" for p a prime, then you can tell him that Sage is faster at arithmetic in GF(p)[x,y,...] than any other program in existence... If it is the Witt vectors, then no. If it is is Z/qZ with q composite, no. William > John > > ---------- Forwarded message ---------- > From: Steffen Reidt <[EMAIL PROTECTED]> > Date: 1 Oct 2007 14:21 > Subject: [LiDIA] multivariate polynomials > To: LIDIA <[EMAIL PROTECTED]> > > > Hi all, > > I have recently installed the LiDIA library and I am quite happy with > it. Nice docu and examples. Now I need to implement some multivariate > polynomials over Z_q in at least 6 variables. According to the > documentation and a brief google search, LiDIA provides no direct > functionality for multivariate polynomials. For efficiency and the > avoidance of headaches I am not keen on a recursive implementation such > as P(x,y) = P1(P2(x)). If anybody knows a good solution for the problem > or has some code available that would be really great. > > Cheers, Steffen > > _______________________________________________ > LiDIA mailing list > [EMAIL PROTECTED] > http://www.cdc.informatik.tu-darmstadt.de/mailman/listinfo/lidia > > > -- > John Cremona > > > > -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
