The Mathematics of Paul Erdős I - Hardcover

Über die Autorin bzw. den Autor

Ronald L. Graham is currently Professor of Mathematics and Irwin and Joan Jacobs Professor of Computer and Information Sciences at the University of California, San Diego, and Chief Scientist at the California Institute for Telecommunications and Information Technology.

Jaroslav Nešetřil is currently Professor of Mathematics and Director of the Institute of Theoretical Computer Science at Charles University, Prague.

Steve Butler is currently Assistant Professor of Mathematics at Iowa State University.

Von der hinteren Coverseite

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, more biographical information about Paul Erdős, and an updated list of publications.

The first volume contains the unique chapter "Early Days", which features personal memories of Paul Erdős by a number of his colleagues. The other three chapters cover number theory, random methods, and geometry. All of these chapters are essentially updated, most notably the geometry chapter that covers the recent solution of the problem on the number of distinct distances in finite planar sets, which was the most popular of Erdős' favorite geometry problems.