Hi,
I posted the following on my blog, but am reposting this is an email
to sage-devel, since it's important
for Sage developers to know about.
Today Chris DiBona (open source programs manager at Google) fully
funded a proposal [1] that some students and I put together to carry
out four Sage development projects this summer (2008):
* Mike Hansen (UCSD): Implement combinatorial species in Sage.
This will provide a backend to handle a wide range of new
combinatorial objects with minimal effort.
* Gary Furnish (Utah): Implement new optimized symbolic
manipulation code in Cython. This will greatly speed up symbolic
computation in Sage, and reduce Sage's dependence on Maxima.
* Robert Miller (UW): Implement fast code for permutation groups
and backtracking algorithms. This is needed for general applications
to graph and code automorphism groups computations, and can be used to
exhaustively generate isomorphism class representatives of a wide
class of mathematical objects.
* Yi Qiang (UW): Further document, improve the usability of, and
provide numerous real world examples of distributed computing with
Sage. This will greatly help in applications of Sage to research that
involve parallel computation.
This funding is not part of the Google Summer of Code (the projects
above do not fit with any of the mentoring organizations), but is
instead I hope part of more longterm support by Google for the Sage
project.
[1] http://wstein.org/grants/google08/google.pdf
--
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
