|
Claudia Lückert

17. John von Neumann Lecture: Prof. Dr. Lisa Sauermann (Universität Bonn): On three-term progression-free sets and related questions in additive combinatorics

Thursday, 17.10.2024 16:15 im Raum M4

Mathematik und Informatik

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. without 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 F_p^n which does not contain a three-term arithmetic progression (i..e without three distinct vectors x,y,z satisfying x+z=2y)? These are long-standing problems in additive combinatorics. This talk will explain the known bounds for these problems, give an overview of some of the proof techniques, and discuss additional applications of these techniques to other additive combinatorics problems.



Angelegt am 21.08.2024 von Claudia Lückert
Geändert am 04.10.2024 von Victoria Liesche
[Edit | Vorlage]

Konferenzen+Kolloquien
Kolloquium Wilhelm Killing
Kolloquium FB10 und Sondervorträge
Highlights des FB10
Mathematics Münster
John von Neumann-Lecture
Veranstaltungen am Mathematischen Institut