Note: This talk begins with a pre-seminar (aimed at graduate students) at 3:30–4:00. The main talk starts at 4:10.
Join Zoom Meeting: https://washington.zoom.us/j/
Meeting ID: 915 4733 5974
The Szemerédi–Trotter theorem can be considered as the fundamental theorem of geometric incidences. This combinatorial theorem has an unusually wide variety of applications, and is used in combinatorics, theoretical computer science, harmonic analysis, number theory, model theory, and more. Surprisingly, hardly anything is known about the structural question - characterizing the cases where the theorem is tight. We present such a structural result for the case of cartesian products. This is a basic survey talk and does not require previous knowledge of the field.
Joint work with Olivine Silier (Caltech).