|
Organizers |
Computational methods for problems in low-height polynomials
by
Ron Ferguson
Simon Fraser University
Coauthors: Peter Borwein
Many famous problems in number theory involve low height polynomials, for example,
low autocorrelation problems or number of zeros or minimums of cosine sums. We
describe computational methods used to obtain insight into these problems involving
stochastic and more systematic searches.
Date received: June 16, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caxo-07.