Power Search
Low Price Guarantee
We Take School POs
Computational Excursions in Analysis and Number Theory 2002 Edition
Contributor(s): Borwein, Peter (Author)

View larger image

 ISBN: 0387954449     ISBN-13: 9780387954448
Publisher: Springer
OUR PRICE: $104.49  

Binding Type: Hardcover - See All Available Formats & Editions
Published: July 2002
Qty:

Annotation: This book is designed for a computationally intensive graduate course based around a collection of classical unsolved extremal problems for polynomials. These problems, all of which lend themselves to extensive computational exploration, live at the interface of analysis, combinatorics and number theory so the techniques involved are diverse.A main computational tool used is the LLL algorithm for finding small vectors in a lattice. Many exercises and open research problems are included. Indeed one aim of the book is to tempt the able reader into the rich possibilities for research in this area. Peter Borwein is Professor of Mathematics at Simon Fraser University and the Associate Director of the Centre for Experimental and Constructive Mathematics. He is also the recipient of the Mathematical Association of America's Chauvenet Prize and the Merten M. Hasse Prize for expository writing in mathematics.

Click for more in this series: CMS Books in Mathematics
Additional Information
BISAC Categories:
- Mathematics | Number Theory
- Medical
Dewey: 512.7
LCCN: 2002019558
Series: CMS Books in Mathematics
Physical Information: 0.59" H x 6.35" W x 9.55" L (0.97 lbs) 220 pages
Features: Bibliography, Illustrated, Index
 
Descriptions, Reviews, Etc.
Publisher Description:
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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!