Wednesday October 4, 2000 from 3:30 - 4:30 in K9509, SFU
Peter Borwein, Simon Fraser University
Some Old Problems in Computational and Diophantine Number Theory
Abstract: A number of classical and not so classical problems in number theory concern finding polynomials with integer coefficients that are of small norm. These include some old chestnuts like the Tarry-Escott problem and Littlewood's (other) Conjecture. Closely related questions on the maximal vanishing of small height polynomials are also discussed. All of these problems lend themselves to computational exploration.