Geometric Discrepancy
An Illustrated Guide
Seiten
2009
|
1999
Springer Berlin (Verlag)
978-3-642-03941-6 (ISBN)
Springer Berlin (Verlag)
978-3-642-03941-6 (ISBN)
What is the "most uniform" way of distributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? This book is an accessible and lively introduction to the area of geometric discrepancy theory.
Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "most uniform" way of dis tributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? For a precise formulation of these questions, we must quantify the irregularity of a given distribution, and discrepancy is a numerical parameter of a point set serving this purpose. Such questions were first tackled in the thirties, with a motivation com ing from number theory. A more or less satisfactory solution of the basic discrepancy problem in the plane was completed in the late sixties, and the analogous higher-dimensional problem is far from solved even today. In the meantime, discrepancy theory blossomed into a field of remarkable breadth and diversity. There are subfields closely connected to the original number theoretic roots of discrepancy theory, areas related to Ramsey theory and to hypergraphs, and also results supporting eminently practical methods and algorithms for numerical integration and similar tasks. The applications in clude financial calculations, computer graphics, and computational physics, just to name a few. This book is an introductory textbook on discrepancy theory. It should be accessible to early graduate students of mathematics or theoretical computer science. At the same time, about half of the book consists of material that up until now was only available in original research papers or in various surveys.
Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "most uniform" way of dis tributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? For a precise formulation of these questions, we must quantify the irregularity of a given distribution, and discrepancy is a numerical parameter of a point set serving this purpose. Such questions were first tackled in the thirties, with a motivation com ing from number theory. A more or less satisfactory solution of the basic discrepancy problem in the plane was completed in the late sixties, and the analogous higher-dimensional problem is far from solved even today. In the meantime, discrepancy theory blossomed into a field of remarkable breadth and diversity. There are subfields closely connected to the original number theoretic roots of discrepancy theory, areas related to Ramsey theory and to hypergraphs, and also results supporting eminently practical methods and algorithms for numerical integration and similar tasks. The applications in clude financial calculations, computer graphics, and computational physics, just to name a few. This book is an introductory textbook on discrepancy theory. It should be accessible to early graduate students of mathematics or theoretical computer science. At the same time, about half of the book consists of material that up until now was only available in original research papers or in various surveys.
1. Introduction.- 2. Low-Discrepancy Sets for Axis-Parallel Boxes.- 3. Upper Bounds in the Lebesgue-Measure Setting.- 4. Combinatorial Discrepancy.- 5. VC-Dimension and Discrepancy.- 6. Lower Bounds.- 7. More Lower Bounds and the Fourier Transform.- A. Tables of Selected Discrepancy Bounds.- Hints.
From the reviews:
"The book gives a very useful introduction to geometric discrepancy theory. The style is quite informal and lively which makes the book easily readable." (Robert F. Tichy, Zentralblatt MATH, Vol. 1197, 2010)| Erscheint lt. Verlag | 15.12.2009 |
|---|---|
| Reihe/Serie | Algorithms and Combinatorics |
| Zusatzinfo | XI, 289 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 452 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Geometrie / Topologie |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| Schlagworte | algorithms • combinatorics • Dimension • discrepancy • Diskrepanz • Gleichverteilung • Grad • Kombinatorik • lattice • Matching • Ramsey theory • Sampling • Stichproben • Uniform distribution |
| ISBN-10 | 3-642-03941-3 / 3642039413 |
| ISBN-13 | 978-3-642-03941-6 / 9783642039416 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Gekrümmte Kurven und Flächen
Buch | Softcover (2024)
De Gruyter (Verlag)
CHF 76,90
Nielsen Methods, Covering Spaces, and Hyperbolic Groups
Buch | Softcover (2024)
De Gruyter (Verlag)
CHF 153,90
