Title: Point-counting and diophantine problems.
Abstract: The Counting Theorem asserts that rational points are rather sparse on suitable "tame" sets in \R^n, subject to certain possible obstructions. I will describe the theorem and the context of sets that are "definable in an o-minimal structure", a notion from model theory, then describe applications to some classical diophantine problems, and recent applications to some less classical ones.
Recording Link: https://huji.cloud.panopto.eu/Panopto/Pages/Viewer.aspx?id=8361659e-09c8...