Prof. Dr Lisa Sauermann
Given some large positive integer N, what is the largest possible size of a subset of {1,…,N} which does not contain a three-term arithmetic progression (i.e., which does not contain three distinct elements x,y,z satisfying x+z=2y)? Similarly, given a prime p and a large positive integer n, what is the largest possible size of a subset of the vector space Fp n which does not contain a three-term arithmetic progression? This talk will explain the known bounds for these longstanding problems in additive combinatorics, give an overview of the proof techniques, and discuss their applications to other additive combinatorics problems.
23.01.2025, Raum: G03-315, Zeit: 17:00