Lectures on discrete geometry

Bibliographic Information

Lectures on discrete geometry

Jiří Matoušek

(Graduate texts in mathematics, 212)

Springer, c2002

  • : hardcover
  • : softcover

Available at  / 92 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. [417]-457) and index

pbk: 24 cm

Description and Table of Contents

Description

The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.

Table of Contents

* Preface * Notation and Terminology * Convexity * Lattices and Minkowski's Theorem * Convex Independent Subsets * Incidence Problems * Convex Polytopes * Number of Faces in Arrangements * Lower Envelopes * More Theorems in Convexity * Geometric Selection Theorems * Transversals and Epsilon-Nets * Attempts to Count k-sets * Two Applications of High-Dimensional Polytopes * Volumes in High Dimension * Measure Concentration and Almost Spherical Sections * Embedding Finite Metric Spaces into Normed Spaces * What Was It About: An Informal Summary * Bibliography * Index

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top