Cantitate/Preț
Produs

Geometric Discrepancy: An Illustrated Guide: Algorithms and Combinatorics, cartea 18

Editat de Jiri Matousek
en Limba Engleză Hardback – 19 mai 1999
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 93785 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 15 dec 2009 93785 lei  6-8 săpt.
Hardback (1) 94397 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 19 mai 1999 94397 lei  6-8 săpt.

Din seria Algorithms and Combinatorics

Preț: 94397 lei

Preț vechi: 115118 lei
-18% Nou

Puncte Express: 1416

Preț estimativ în valută:
18079 18626$ 15144£

Carte tipărită la comandă

Livrare economică 24 februarie-10 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540655282
ISBN-10: 354065528X
Pagini: 306
Ilustrații: XI, 289 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Recenzii

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)

Textul de pe ultima copertă

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? Such questions are treated in geometric discrepancy theory. The book is an accessible and lively introduction to this area, with numerous exercises and illustrations. In separate, more specialized parts, it also provides a comprehensive guide to recent research. Including a wide variety of mathematical techniques (from harmonic analysis, combinatorics, algebra etc.) in action on non-trivial examples, the book is suitable for a "special topic" course for early graduates in mathematics and computer science. Besides professional mathematicians, it will be of interest to specialists in fields where a large collection of objects should be "uniformly" represented by a smaller sample (such as high-dimensional numerical integration in computational physics or financial mathematics, efficient divide-and-conquer algorithms in computer science, etc.).
From the reviews: "...The numerous illustrations are well placed and instructive. The clear and elegant exposition conveys a wealth of intuitive insights into the techniques utilized. Each section usually consists of text, historical remarks and references for the specialist, and exercises. Hints are provided for the more difficult exercises, with the exercise-hint format permitting inclusion of more results than otherwise would be possible in a book of this size..."
Allen D. Rogers, Mathematical Reviews Clippings (2001)
 

Caracteristici

Only up-to-date comprehensive guide to the subject Includes supplementary material: sn.pub/extras