Geometric Combinatorics, Easter 2010

Projective transform of a regular 10-gon
Blocking visibility with few points
Construction is due to Rom Pinchasi


Mondays, Wednesdays, Fridays 10am




This short lecture course will focus on a selection of topics from geometric combinatorics. We shall discuss combinatorial convexity theorems of Helly, Carathéodory, Tverberg and their relatives, geometric discrepancy and VC-dimension, and Szemerédi–Trotter theorem.


The book Lectures on Discrete Geometry by Jiří Matoušek is easily the best introduction to discrete geometry. Most of the material that we will cover is in the book. A copy is on reserve in the library. Another worthy book is Lectures on Discrete and Polyhedral Geometry by Igor Pak. It is a great read, but overlaps with the content of this course much less. It is available freely from the author's webpage. The material on discrepancy is mostly from Geometric discrepancy (An illustrated guide) by Matoušek, and Discrepancy method by Bernard Chazelle. A PDF of the latter book is on the author's webpage.


Note that there will be no lecture on May 19 due to a One-Day Colloquim in Combinatorics in London.

Back to the homepage