Notes on discrete and polyhedral geometry
Friday, August 28, 2009 10:04Problems in discrete geometry (i.e. the border between combinatorics and geometry) have made several recent appearances on the IMO (typically, granted as Q6). A nice book by Igor Pak covers much of the important material in this area — the book is aimed at undergaduate and graduate students in maths, but the first few chapters in particular are suitable for Olympiad level students.
As in many cases, the important thing is not the results themselves (though Helly’s theorem is a useful tool in lots of setting) but the “style” of proofs in this area.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.
Aleks says:
September 10th, 2011 at 8:22 am
The website has been discontinued I think.