Computational excursions in analysis and number theory
Author(s)
Bibliographic Information
Computational excursions in analysis and number theory
(CMS books in mathematics, 10)
Springer, c2002
Available at 33 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 203-216) and index
Description and Table of Contents
Description
This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic problems. There are many exercises and open research problems included.
Table of Contents
* 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 Erdoes-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
by "Nielsen BookData"