zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Computational excursions in analysis and number theory. (English) Zbl 1020.12001
CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. 10. New York, NY: Springer. x, 220 p. EUR 69.95/net; sFr 116.00; £ 49.00; $ 69.95 (2002).
The author considers a series of problems about topics on the boundary between analysis and number theory. They are all related to the properties of certain polynomials, they are at least 40 years old, and none of them is completely solved. They are also suited for computational experiments. The book contains a variety of techniques from several branches of mathematics to enable the reader to carry out his own research. In the introduction various sets of polynomials are defined as well as several measures. This is followed by a few results from complex analysis. Then the author gives a list of 17 open problems around which the later chapters are centered. (Those are again listed in Appendix D.) In Chapter 2 (shortly) and Appendix B (at length) lattice basis reduction techniques and integer relation finding methods are discussed. Then the applicability of these methods for finding polynomials with prescribed properties of their coefficients is developed. The next chapters contain Pisot and Salem numbers and special series of polynomials. They are followed by a discusion of the location of the zeros and Diophantine approximation of those. Then several open problems are considered: -- The Integer Chebyshev Problem of finding non-zero polynomials of $\Bbb Z [x]$ of smallest supremum norm in the interval $[0,1]$ and analyzing the asymptotic behaviour when the degree tends to infinity. -- The Prouhet-Tarry-Escott Problem of finding polynomials of $\Bbb Z [x]$ divisible by $(x-1)^n$ and minimal sum of the absolute values of the coefficients. -- The Erdős-Szekeres Problem of minimizing $$ \Biggl\|\prod_{i=1}^n (1-x^{a_i}) \Biggr\|_{\infty} $$ for $a_i \in \Bbb N$ and proving that these minima grow faster than $n^{\beta}$ for any positive constant $\beta$. -- The Littlewood Problem of finding polynomials with coefficients in $\{ \pm 1 \}$ with smallest $L_p$-norm on the unit disk. Additional chapters deal with a variant of Waring’s problem, Barker polynomials and Golay pairs, and spectra of values of classes of polynomials evaluated at a fixed number $q$. Besides the aforementioned Appendices B and D, Appendix A contains a compendium of inequalities and Appendix C on explicit merit factor formulae. Each chapter ends with lists of computational and research problems and selected additional references. The treatment of the various topics is very concise. Clearly, the book is written by one of the leading experts in this area of mathematics.
Reviewer: M.Pohst (Berlin)

12-02Research monographs (field theory)
11-02Research monographs (number theory)
11R09Polynomials over global fields
11C08Polynomials (number theory)
11Y99Computational number theory
12D05Factorization of real or complex polynomials
12D10Algebraic theorems of location of zeros of polynomials over R or C
12E05Polynomials over general fields
12Y05Computational aspects of field theory and polynomials
42C05General theory of orthogonal functions and polynomials