Differences between revisions 1 and 27 (spanning 26 versions)
Revision 1 as of 2007-05-15 16:20:30
Size: 3954
Editor: wstein
Comment:
Revision 27 as of 2007-06-06 16:48:05
Size: 3688
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
== Daily schedule == Schedule for [:days4: SAGE Days 4], which is June 12-17, 2007.
Line 3: Line 3:
9-12: (optional) early-bird coffee, bagels, etc. == Invited Colloquium Speakers ==
 * Sarah Billey (UW Math): TBA
 * Henry Cohn (Microsoft Research, June 13): TBA
 * Charles Doran (UW Math, June 17 at 11am): TBA
 * Randy Leveque (UW Applied Math): TBA
 * Jim Morrow (UW Math): '''Graph theory and electrical networks.'''
 * Paul Beame (UW Computer Science): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.'''
Line 5: Line 11:
12-1 lunch at a designated restaurant = Daily schedule =
Line 7: Line 13:
1:30 - 2:30 talk on improvements made to SAGE We have the following locations reserved:
 * [http://www.washington.edu/home/maps/northcentral.html?MEB MEB] (Mechanical Engineering Building) Room 328, 7:00am-10:00pm
 * [http://www.washington.edu/home/maps/northcentral.html?PDL PDL] (Padelford) Room C36, late
 * PDL C401, late
 * William's Office: PDL C423, all hours (very very low occupancy)
 * SAGE Lab: [http://www.washington.edu/home/maps/northcentral.html?SIG SIG] (Sieg Hall) 312, all building hours (UW people have keys to room door, but our key card access is inactive)
Line 9: Line 20:
3:00 - 4:00 talk on what SAGE needs in order to improve Unless otherwise stated, the daytime (talks and sprints before dinner) sessions will take place in MEB 328, and late-night coding sprints will take place in one of the above Padelford locations and the SAGE Lab, provided we have at least one person in Sieg after it closes.
Line 11: Line 22:
4:30 - 5:00 strategy session == Tuesday, June 12 ==
Line 13: Line 24:
5:00 - 7:00 coding sprints  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 William Stein -- '''State of the SAGE project'''
 * 3:00 - 4:00 Jim Morrow (UW Math): '''Graph theory and electrical networks.''' (time not confirmed)
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very late: coding sprints
Line 15: Line 33:
7:00 - 9:00 dinner == Wednesday, June 13 ==
Line 17: Line 35:
9:00 - very late: coding sprints  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 David Harvey (Harvard Math): '''FLINT and Fast Polynomial Arithmetic'''
 * 3:00 - 4:00 Henry Cohn (Microsoft Research) -- colloquium talk
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very late: coding sprints
Line 19: Line 44:
== Individual Projects == == Thursday, June 14 ==
Line 21: Line 46:
 * 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.  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 David Roe: '''The New Improved p-adics'''
 * 3:00 - 4:00 Randy Leveque (UW Applied Math): TBA (time not confirmed)
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very late: coding sprints
Line 23: Line 55:
 * 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. == Friday, June 15 ==
Line 25: Line 57:
 * 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.)  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 Robert Bradshaw: TBA
 * 3:00 - 4:00 Sarah Billey (UW Math): TBA (time not yet confirmed)
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very late: coding sprints
Line 27: Line 66:
 * 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. == Saturday, June 16 ==
Line 29: Line 68:
 * 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.  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 Carl Witty (Newton Research Labs): '''Fast real root isolation''' (tentative)
 * 3:00 - 4:00 Paul Beame (UW Computer Science): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.'''
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very very late: coding sprints
Line 31: Line 77:
 * 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. == Sunday, June 17 ==
Line 33: Line 79:
 * 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.  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 Chuck Doran (UW Math): '''Lattice Polytopes and Geometry'''
 * 3:00 - 6:00 Wrap-up sessions; results of coding sprints
 

Schedule for [:days4: SAGE Days 4], which is June 12-17, 2007.

Invited Colloquium Speakers

  • Sarah Billey (UW Math): TBA
  • Henry Cohn (Microsoft Research, June 13): TBA
  • Charles Doran (UW Math, June 17 at 11am): TBA
  • Randy Leveque (UW Applied Math): TBA
  • Jim Morrow (UW Math): Graph theory and electrical networks.

  • Paul Beame (UW Computer Science): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.

Daily schedule

We have the following locations reserved:

Unless otherwise stated, the daytime (talks and sprints before dinner) sessions will take place in MEB 328, and late-night coding sprints will take place in one of the above Padelford locations and the SAGE Lab, provided we have at least one person in Sieg after it closes.

Tuesday, June 12

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 William Stein -- State of the SAGE project

  • 3:00 - 4:00 Jim Morrow (UW Math): Graph theory and electrical networks. (time not confirmed)

  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very late: coding sprints

Wednesday, June 13

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 David Harvey (Harvard Math): FLINT and Fast Polynomial Arithmetic

  • 3:00 - 4:00 Henry Cohn (Microsoft Research) -- colloquium talk
  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very late: coding sprints

Thursday, June 14

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 David Roe: The New Improved p-adics

  • 3:00 - 4:00 Randy Leveque (UW Applied Math): TBA (time not confirmed)
  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very late: coding sprints

Friday, June 15

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 Robert Bradshaw: TBA
  • 3:00 - 4:00 Sarah Billey (UW Math): TBA (time not yet confirmed)
  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very late: coding sprints

Saturday, June 16

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 Carl Witty (Newton Research Labs): Fast real root isolation (tentative)

  • 3:00 - 4:00 Paul Beame (UW Computer Science): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.

  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very very late: coding sprints

Sunday, June 17

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 Chuck Doran (UW Math): Lattice Polytopes and Geometry

  • 3:00 - 6:00 Wrap-up sessions; results of coding sprints

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