Computational Excursions in Analysis and Number Theory
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 th...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
2002, 2002
|
| Edition: | 1st ed. 2002 |
| Series: | CMS Books in Mathematics, Ouvrages de mathématiques de la SMC
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
| Summary: | 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 |
|---|---|
| Physical Description: | X, 220 p. 4 illus online resource |
| ISBN: | 9780387216522 |