On Thursday 06 January 2011, Simon King wrote: > Alternatively, it could be a method of polynomial ideals, since ideals > in Sage have a fixed list of generators - like f_1,...,f_r.
While that's true note that in principle the design is such that we distinguish between ideals and their generating sets. For example: reduction by an ideal f.reduce() is different from reduction by a list of generators. Also, this is the reason why the interreduced_basis() is somewhat awkwardly named: it shouldn't be a function on ideals but we didn't really have any other object. mq.MPolynomialSystem might be a good candidate for stuff that really works with polynomial lists but it would have to be moved away from the crypto module first. Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://martinralbrecht.wordpress.com/ _jab: martinralbre...@jabber.ccc.de -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
