Special Intensive Graduate Course in Computational Number Theory
June 17, 2002 to June 28, 2002

MSRI. I have reserved spots for local participants (who can take this for graduate credit). Anyone interested should come and see me.
See also http://zeta.msri.org/calendar/programs/ProgramInfo/70/show_program

TITLE: EXCURSIONS in COMPUTATIONAL NUMBER THEORY -- Polynomials with Integer Coefficients

at Simon Fraser University, Vancouver, BC Canada

Organized by: Peter Borwein (Simon Fraser University) and Michael Filaseta University of South Carolina)

Note: This Summer Graduate Program will take place in Vancouver, BC, Canada at the Pacific Institute of Mathematics facility of Simon Fraser University.

This summer graduate program centers on a variety of computational problems in number theory. These problems all formulate as questions on polynomials with integer coefficients.

Topics include factorization, irreducibility, location of zeros, solutions of Diophantine equations and algorithmic issues (like LLL). An attractive feature is that there are many open problems that are easy to formulate and lend themselves to extensive theoretical and computational exploration. Some of the better known open problems include Lehmer's conjecture, versions of the Waring problem and Littlewood's conjectures.

There will be two or three lectures each day. Afternoon workshops will be based around group explorations of research oriented problems.

Students will be expected to have a base level of computational skill (Maple, Mathematica, Matlab or C).