Hi everybody, (sorry for my late replies the university where the conference is at which I'm attending blocks e-mail)
F4 does not require homogenization and only (IIRC) suggests to use the normal selection strategy. Matrix-F5 (as described in literature) is quite different from F4 because it multiplies by all monomials of a given degree not only those suggested by the critical pairs. The F4-style F5 would use critical pairs (just like the polynomial F5) but linear algebra in the reduction step. I wouldn't be discouraged only because your implementation was slower in Maple because I don't know much about the efficiency of Maple's linear algebra. Cheers, Martin PS: As we're not discussing the toy implementations anymore, feel free open a new thread :-) -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ 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://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
