Discrete Geometry

28 February - 30 May 2025

Fridays, 10:15 - 12:00

Location: HG G 43

First lecture: 28 February

Abstract

Discrete geometry studies arrangements of points, lines and other geometric objects in Euclidean spaces. Despite its humble origins, the subject has blossomed into a central area that connects combinatorics, graph theory, and convex geometry, with applications in computer science, harmonic analysis and number theory.

The course will serve as an introduction to discrete geometry, starting with the classical topics and covering several recent advances and
methods.

Syllabus:
* Combinatorial convexity and intersection patterns of convex sets
* Selection theorems and epsilon nets
* Discrepancy
* Incidence problems
* Polynomial partitioning