Computational Excursions in Analysis and Number Theory

Preface.- Introduction.- LLL and PSLQ.- Pisot and Salem Numbers.- Rudin-Shapiro Polynomials.- Fekete Polynomials.- Products of Cyclotomic Polynomials.- Location of Zeros.- Maximal Vanishing.- Diophantine Approximation of Zeros.- The Integer-Chebyshev Problem.- The Prouhet-Tarry-Escott Problem.- The Easier Waring Problem.- The Erdos-Szekeres Problem.- Barker Polynomials and Golay Pairs.- The Littlewood Problem.- Spectra.- Appendix A: A Compendium of Inequalities.- B: Lattice Basis Reduction and Integer Relations.- C: Explicit Merit Factor Formulae.- D: Research Problems.- References.- Index.