Computational Excursions in Analysis and Number Theory
Seiten
2010
|
Softcover reprint of the original 1st ed. 2002
Springer-Verlag New York Inc.
978-1-4419-3000-2 (ISBN)
Springer-Verlag New York Inc.
978-1-4419-3000-2 (ISBN)
Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, "the circle method," and Diophantine and analytic techniques.
This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 .... All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, "the circle method," and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.
This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 .... All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, "the circle method," and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.
1 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 The Integer Chebyshev Problem.- 11 The Prouhet-Tarry-Escott Problem.- 12 The Easier Waring Problem.- 13 The Erd?s-Szekeres Problem.- 14 Barker Polynomials and Golay Pairs.- 15 The Littlewood Problem.- 16 Spectra.- A A Compendium of Inequalities.- B Lattice Basis Reduction and Integer Relations.- C Explicit Merit Factor Formulae.- D Research Problems.
| Erscheint lt. Verlag | 3.12.2010 |
|---|---|
| Reihe/Serie | CMS Books in Mathematics |
| Zusatzinfo | 4 Illustrations, black and white; X, 220 p. 4 illus. |
| Verlagsort | New York, NY |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie | |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| ISBN-10 | 1-4419-3000-0 / 1441930000 |
| ISBN-13 | 978-1-4419-3000-2 / 9781441930002 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
Eine Einführung mit Java
Buch | Hardcover (2020)
dpunkt (Verlag)
CHF 62,85
