 BROWSE
 USED
 STAFF PICKS
 GIFTS + GIFT CARDS
 SELL BOOKS
 BLOG
 EVENTS
 FIND A STORE
 800.878.7323

$150.50
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for Instore Pickup
in 7 to 12 days
This title in other editionsOther titles in the CMS Books in Mathematics series:
Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)by Peter Borwein
Synopses & ReviewsPublisher Comments: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 Americas Chauvenet Prize and the Merten M. Hasse Prize for expository writing in mathematics.
Synopsis: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 * RudinShapiro Polynomials * Fekete Polynomials * Products of Cyclotomic Polynomials * Location of Zeros * Maximal Vanishing * Diophantine Approximation of Zeros * The IntegerChebyshev Problem * The ProuhetTarryEscott Problem * The Easier Waring Problem * The ErdösSzekeres 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
What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Related Subjects
Computers and Internet » Computers Reference » General


