Differences between revisions 2 and 91 (spanning 89 versions)
Revision 2 as of 2007-05-15 20:03:21
Size: 4751
Editor: wstein
Revision 91 as of 2008-11-14 13:41:57
Size: 1456
Editor: localhost
Comment: converted to 1.6 markup
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:
Coding sprint and project ideas for [[days4|SAGE Days 4]] June 12-17, 2007.
Line 3: Line 4:
Project ideas for [:days4: SAGE Days 4]. Each section lists the project followed by the main contact person for that project.
Line 5: Line 6:
 * Nick Alexander: I'd like to implement some basic linear algebra over Z/nZ, following perhaps ``Algorithms for Linear Algebra Problems over Principal Ideal Rings'' (1996), Johannes Buchmann, Stefan Neis at http://citeseer.ist.psu.edu/719844.html. I'm also very interested in working on the commutative diagram coercion model proposed by David Roe.  * [[days4/projects/packaging| Packaging and Distributing SAGE]] -- Didier (remote)
 * [[days4/projects/nb| The SAGE Notebook]] -- William Stein
Line 7: Line 10:
 * David Joyner: I'm interested in adding functionality to the group theory functionality in SAGE. I'm also interested in coding theory and in particular Robert Miller's work on (now GPL'd) Leon's partition backtracking programs.  * [[days4/projects/dist| Distributed Computation]] -- Yi Qiang
Line 9: Line 12:
 * 3d Graphics (Kirsten Fagnan)  * [[days4/projects/doc| Documentation]] -- ???
Line 11: Line 14:
 * Numerical Methods (Kirsten Fagnan)  * [[days4/projects/numerical| Numerical Computation]] -- Josh Kantor
Line 13: Line 16:
 * p-Adic Arithmetic: Design and implement highly optimized algorithms for arithmetic with p-adic numbers. The current implementation is already extensive, containing a wide range of different models of p-adic arithmetic (capped relative, capped absolute, lazy, extensions, etc.) but many new algorithms need to be developed, especially for arithmetic with polynomials over the p-adics, for p-adic linear algebra, for computing in the lattice of extensions of a p-adic ring, and for computing with completions of a number field. (This project started at SAGE Days 2, and has been very actively pursued, especially by David Roe during the last 7 months.)  * [[days4/projects/arith| Basic Arithmetic ]] -- Robert Bradshaw
Line 15: Line 18:
 * Applications of Monsky-Washnitzer Cohomology: Investigate algorithms for fast point counting on elliptic and hyperelliptic curves, computation of p-adic height pairings, and computations of p-adic Coleman integrals. This project began in 2006 at an MSRI workshop, and has been an active area of work during the last year by Kiran Kedlaya, David Harvey, and Robert Bradshaw. In particular, Harvey has recently developed new algorithms that will be explored at the workshop, which allow for new efficient point counting on Jacobians of hyperelliptic curves, Bradshaw and Kedlaya have implemented Coleman integration which has application to the study of rational points on curves, and Stein has been investigating p-adic analogues of the Birch and Swinnerton-Dyer conjecture in many new cases using a new algorithm for computing p-adic heights.  * [[days4/projects/colors| Fast Type Isolation ]] -- ???
Line 17: Line 20:
 * Quaternion Algebra Arithmetic and Modular Forms: Create and implement algorithms for efficient arithmetic in quaternion algebras, and apply this work to computation of Hecke operators, modular forms, Tamagawa numbers of modular abelian varieties, and enumeration of elliptic curves of large conductor. Gonzalo Tornaria has long worked in this area, and William Stein is working with David Kohel and Lassina Dembele on the design of better algorithms.  * [[days4/projects/numbertheory| Number Theory]] -- David Roe
Line 19: Line 22:
 * Distributed Parallel Computation: Continuing a major trend started at the MSRI workshop in January 2007 on parallel computation, participants will design algorithms for parallel distributed integer factorization, computation of Hecke eigenvalues, and other algorithms. In particular, participants will explore several of the other ideas listed above in the context of parallel computation. Implementing these algorithms will likely vastly improve the stability and reliability of distributed computation in SAGE.  * [[days4/projects/database| Databases]] -- Robert Miller
Line 21: Line 24:
 * Optimized Polynomial Arithmetic: David Harvey and Bill Hart (Postdoc, Warwick) have recently created and implemented what is by far the world’s fastest code for univariate polynomial arithmetic. Explore how to fill in the remaining gaps in order to make the results of their work easily available to a larger user community. Similarly, Tom Boothby has worked for about 9 months on algorithms for very fast evaluation of polynomials at points, and another project will be to explore how to deploy this.  * (Tabled) [[days4/projects/coding| Coding Theory]] -- Robert Miller
Line 23: Line 26:
 * Commutative Diagram Coercion Model: The current SAGE coercion model has some advantages (speed, ability to override for new classes) but also some issues. A user is not able to override the coercion system at runtime and use their own coercion maps (this could be incredibly useful for polynomials, or systems of field extensions). It is difficult to get a system-wide picture of what coercion maps exist: as SAGE grows, this will introduce bugs when the rules for transitivity of coercion are not followed. It is also difficult, though not impossible, to implement coercion systems where the computation of the coercion map requires effort (creating a coercion map from GF(7^8) -> GF(7^24)). I want to discuss a new coercion model, either replacing over built on top of the old, that addresses these problems. Currently I have some ideas for a system based on commutative diagrams, but I want to brainstorm some more before implementing it. This project will include discussions on ways to improve category theory in SAGE.  * [[days4/projects/groups| Group Theory]] -- David Joyner
 * [[days4/projects/linalg| Linear Algebra]] -- Nick Alexander

 * [[days4/projects/combinat| Combinatorics]] -- Mike Hansen (remote)

 * [[days4/projects/calculus| Symbolic Calculus]] -- Bobby Moretti

 * [[days4/projects/graphs| Graph Theory]] -- Emily Kirkman

 * [[days4/projects/3d| 3d Graphics]] -- Robert Bradshaw

 * [[days4/projects/emacs| sage-mode for GNU Emacs]] -- Nick Alexander

 * [[days4/projects/mottos| Mottos and Quotes]] -- ???
 * [[days4/projects/redbull| Staple the Dead Beaver to the Sidewalk]]


Coding sprint and project ideas for SAGE Days 4 June 12-17, 2007.

Each section lists the project followed by the main contact person for that project.

days4/projects (last edited 2008-11-14 13:41:57 by localhost)