On 10/28/07, Martin Albrecht <[EMAIL PROTECTED]> wrote:
> I am working on a talk on SAGE for the RHUL PhD seminar and thus I wondered
> what functionality SAGE implements that was not implemented before in the
> open-source world. By 'implement' I do not mean wrapping some library or
> using the CLI of some other CAS/mathematics package. So far
>
> \item free re-implementation of Nauty's graph isomorphism algorithm
> \item arithmetic with $p$-adic numbers
> \item sparse linear algebra (over $\field{F}_p$)
> \item task farming distributed computing
>
> came to mind.
>
> What else?* modular symbols * modular forms * modular abelian varieties * computing with Dirichlet characters * Eisenstein series enumeration * half-integral weight modular forms * arithmetic on jacobians of curves * m4ri? -- seen first in Sage * quaternion algebras * p-adic L-functions of elliptic curves in a lot of generality, with proven precision (and this is *only* available in Sage) * fast computation of p-adic heights on elliptic curves (only in Sage) * Coleman integration (only in Sage) * fast computation of the number of partitions of an integer (Jon Bobber) * that algorithm we came up with for fast echelon form computation over QQ that builds on IML's p-adic nullspace algorithm There are probably many others, but those are what come to my mind immediately. -- William --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
