A structural Szemerédi–Trotter theorem for cartesian products

Abstract: 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 structural results 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. Also, a shameless advertisement of the speaker's new book "Polynomial Methods and Incidence Theory."

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456