# Computational Excursions in Analysis and Number Theory

Part of the CMS Books in Mathematics / Ouvrages de mathématiques de la SMC book series (CMSBM)

Advertisement

Part of the CMS Books in Mathematics / Ouvrages de mathématiques de la SMC book series (CMSBM)

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.

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.

Diophantine approximation Maxima algorithms calculus combinatorics computational number theory extrema maximum number theory

- DOI https://doi.org/10.1007/978-0-387-21652-2
- Copyright Information Springer-Verlag New York 2002
- Publisher Name Springer, New York, NY
- eBook Packages Springer Book Archive
- Print ISBN 978-1-4419-3000-2
- Online ISBN 978-0-387-21652-2
- Series Print ISSN 1613-5237
- Buy this book on publisher's site