Lectures on Discrete Geometry

Jiri Matousek

482 pages, parution le 30/05/2002

Ajouter à une liste

Indisponible

Résumé

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization.

This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics 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; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces.

Contents

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

L'auteur - Jiri Matousek

Charles University, Prague, Czechoslovakia

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Jiri Matousek
Parution	30/05/2002
Nb. de pages	482
Format	15,5 x 23,5
Couverture	Broché
Poids	711g
Intérieur	Noir et Blanc
EAN13	9780387953748
ISBN13	978-0-387-95374-8