WORKSHOP: THE COMPUTER ALGEBRA SYSTEM PARI/GP A week-long workshop on computational number theory in the context of the Computer Algebra system PARI/GP will be held September 13 -- 17, 2004. The meeting will take place at the Centre Emile Borel of the Institute Henri Poincare as part of the trimester on "Explicit Methods in Number Theory" ( see http://www.ihp.jussieu.fr ). The goal of the workshop is to gather people developing the PARI/GP system, or related systems dedicated to arithmetic, and users of such systems. =========================================================================== SCHEDULE ======== Monday 13 ========= 10h - 11h: K. Belabas, "Development and structure of the PARI library" (break) 11h30 - 12h30: B. Allombert, "The GP language: past, present and future" 14h - 15h: D. Simon, "Reduction of indefinite quadratic forms and applications" 15h - 16h: Discussions: "TODO / wishlist" (break) 16h30 - 18h00: Discussions: "TODO / wishlist" Tuesday 14 ========== 10h - 11h: K. Belabas, "Paradigms of PARI programming" (break) 11h30 - 12h30: B. Allombert, "The GP2C compiler" 14h - 15h: X.-F. Roblot, "Computing values of p-adic Dirichlet L-functions" 15h - 16h: J. Cremona, "Computing Heegner points" (break) 16h30 - 18h00: Hacking session Wednesday 15 ============ 10h - 11h: H. Cohen, "High precision numerical integration" (break) 11h30 - 12h30: P. Zimmermann, "MPFR: a multiple-precision floating-point library with correct rounding" 14h - 16h: Discussions: "Questions / Answers" (break) 16h30 - 18h00: Discussions: "Questions / Answers" Thursday 16 =========== 10h - 11h: H. Gangl: "K-culations" (break) 11h30 - 12h30: X.-F. Roblot: "Checking the Brumer-Stark conjecture" 14h - 16h: Discussions (break) 16h30 - 18h00: Discussions Friday 17 ========= 14h - 16h: G. Hanrot, "Lattice reduction" (break) =========================================================================== ORGANISERS: Karim Belabas ( Karim.Belabas@math.u-psud.fr ) Xavier-François Roblot ( roblot@igd.univ-lyon1.fr ) ===========================================================================