On some aspects of the relation between size and additive structure
A talk in the Other series by
Asgar Jamneshan
| Abstract: | The catch of Szemeredi's theorem is that arithmetic structure is
indestructible: If a set of integers is large enough, then it must contain
arithmetic structure. Szemeredi's theorem has found various proofs. In
this talk, I will give a high-level presentation of two of its influential
proofs, the dynamical proof of Furstenberg and the Fourier analytic proof of
Gowers; focusing on some structural and conceptual analogies between these
two approaches. Then I will report on recent progress towards a
unification. This talk is partially based on joint works with Terence Tao
and Or Shalom. It is intended to be self-contained and accessible to anyone
with a general graduate-level mathematical background. Within the CRC this talk is associated to the project(s): A6 |