Computational Excursions in Analysis and Number Theory

Authors:

ISBN: 978-1-4419-3000-2 (Print) 978-0-387-21652-2 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages i-x

  2. No Access

    Book Chapter

    Pages 1-9

    Introduction

  3. No Access

    Book Chapter

    Pages 11-13

    LLL and PSLQ

  4. No Access

    Book Chapter

    Pages 15-26

    Pisot and Salem Numbers

  5. No Access

    Book Chapter

    Pages 27-35

    Rudin—Shapiro Polynomials

  6. No Access

    Book Chapter

    Pages 37-42

    Fekete Polynomials

  7. No Access

    Book Chapter

    Pages 43-52

    Products of Cyclotomic Polynomials

  8. No Access

    Book Chapter

    Pages 53-58

    Location of Zeros

  9. No Access

    Book Chapter

    Pages 59-66

    Maximal Vanishing

  10. No Access

    Book Chapter

    Pages 67-74

    Diophantine Approximation of Zeros

  11. No Access

    Book Chapter

    Pages 75-84

    The Integer Chebyshev Problem

  12. No Access

    Book Chapter

    Pages 85-95

    The Prouhet—Tarry—Escott Problem

  13. No Access

    Book Chapter

    Pages 97-101

    The Easier Waring Problem

  14. No Access

    Book Chapter

    Pages 103-107

    The Erdős—Szekeres Problem

  15. No Access

    Book Chapter

    Pages 109-119

    Barker Polynomials and Golay Pairs

  16. No Access

    Book Chapter

    Pages 121-132

    The Littlewood Problem

  17. No Access

    Book Chapter

    Pages 133-139

    Spectra

  18. Back Matter

    Pages 141-220