> Polynomials over Fields of Characteristic zero in the beginning. But the > algorithms are formulated in the general setting. But all the > applications that come to my mind are for characteristic 0.
okay, you'll get support for QQ and absolute number fields using libSingular. Relative number fields should also be do-able. > Probably this is different in Coding/Kryptotheory ? We like characteristic two a lot here. > >> Integer Lattices are all over the place with binomial ideals. Are there > >> classes for integer lattices, or is someone working on such things? > > > > We have some lattice algorithms (LLL and BKZ) which act on integer > > matrices: > > > > sage: A = random_matrix(ZZ, 10, 10) > > sage: A.LLL() > > sage: A.BKZ() > > Nice ... It actually also is quite fast thanks to fpLLL and afaik the only publically available (open-source) implementation of BKZ in NTL. Cheers, Martin -- 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 -~----------~----~----~----~------~----~------~--~---
