On Thu, Feb 19, 2009 at 10:47 PM, Nick Alexander <ncalexan...@gmail.com> wrote: > > > On 19-Feb-09, at 10:38 PM, William Stein wrote: > >> >> On Thu, Feb 19, 2009 at 10:33 PM, Nick Alexander <ncalexan...@gmail.com >> > wrote: >>> >>>> So it looks like this is a BSD license for all intents and purposes. >>> >>> The author claims it is BSD license with 3 clauses. It seems that a >>> naive Cholesky is a few dozen lines, so I could probably just crack a >>> text book :) >> >> Just out of curiosity, you wouldn't happen to be implementing >> some sort of lattice basic reduction-related algorithm would you? > > Sort of? Not basis reduction per se, but I want to evaluate theta > functions to high precision. Standard methods for doing this quickly > include enumerating short lattice vectors. I really don't care much > about doing this in a novel way, but I really want it in sage, and > I've just found some code that does this well.
Yep, that's what I thought. I just taught some related things in my course last quarter. I really hope you'll make your code available, even if it isn't polished. People could work on it during SD13 -- quadratic forms: http://wiki.sagemath.org/days13 William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
