Computational Excursions in Analysis and Number Theory

Includes index

Includes Bibliography (p. 203-216)

Introduction
2. LLL and PSLQ
3. Pisot and Salem Numbers
4. Rudin-Shapiro Polynomials
5. Fekete Polynomials
6. Products of Cyclotomic Polynomials
7. Location of Zeros
8. Maximal Vanishing
9. Diophantine Approximation of Zeros
10. Integer Chebyshev Problem
11. Prouhet-Tarry-Escott Problem
12. Easier Waring Problem
13. Erdos-Szekeres Problem
14. Barker Polynomials and Golay Pairs
15. Littlewood Problem
16. Spectra
17. Compendium of Inequalities
18. Lattice Basis Reduction and Integer Relations
19. Explicit Merit Factor Formulae
20. Research Problems

This book focuses on a variety of problems in number theory and analysis. The problems concern polynomials with integer coefficients and typically ask something about the size of the polynomial with an appriopriate measure of size and often with some restriction on the height and the degree - introduction