Differences between revisions 1 and 15 (spanning 14 versions)
Revision 1 as of 2007-05-15 16:20:30
Size: 3954
Editor: wstein
Comment:
Revision 15 as of 2007-05-25 02:53:50
Size: 815
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
== Daily schedule == = Daily schedule =

Schedule for [:days4: SAGE Days 4].
Line 19: Line 21:
== Individual Projects == = Talks =
Line 21: Line 23:
 * 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.  * Sarah Billey (UW Math): TBA
Line 23: Line 25:
 * 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.  * Henry Cohn (Microsoft Research, June 13): TBA
Line 25: Line 27:
 * 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.)  * Charles Doran (UW Math, June 17 at 11am)
Line 27: Line 29:
 * 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.  * Randy Leveque (UW Applied Math): TBA
Line 29: Line 31:
 * 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.  * Jim Morrow (UW Math): Graph theory and electrical networks.
Line 31: Line 33:
 * 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.

 * 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.
 * Paul Beame (UW Computer Science, June 16 at 3pm): ''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''

Daily schedule

Schedule for [:days4: SAGE Days 4].

9-12: (optional) early-bird coffee, bagels, etc.

12-1 lunch at a designated restaurant

1:30 - 2:30 talk on improvements made to SAGE

3:00 - 4:00 talk on what SAGE needs in order to improve

4:30 - 5:00 strategy session

5:00 - 7:00 coding sprints

7:00 - 9:00 dinner

9:00 - very late: coding sprints

Talks

  • Sarah Billey (UW Math): TBA
  • Henry Cohn (Microsoft Research, June 13): TBA
  • Charles Doran (UW Math, June 17 at 11am)
  • Randy Leveque (UW Applied Math): TBA
  • Jim Morrow (UW Math): Graph theory and electrical networks.
  • Paul Beame (UW Computer Science, June 16 at 3pm): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.

days4schedule (last edited 2008-11-14 13:42:10 by anonymous)