Publication

2002-07-12 - Springer

Language

English

Word Count

58,000 words, Guess

Page Count

232 pages

Identifiers

and 7 more
  • ISBN-139780387954448
  • Goodreads5003840
  • LibraryThing4695962
  • Library of Congress Control Number2002019558
  • OCLC Control Number48892598
  • Better World Books9780387954448
  • Open LibraryOL7448940M

Classifications

  • LCCQA241 .B7748 2002
  • LCCQA241-247.5

Description

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.

Subjects

Other Editions

  • Computational Excursions in Analysis and Number TheorySpringer2002-07-12

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!