一、题目

Progressions in sparse pseudorandom sets

二、主讲人

赵宇飞

三、摘要

I will explain some key ideas in the proof of the Green--Tao theorem, following the graph theoretic approach due to Conlon, Fox, and myself. Topics include sparse graph regularity, counting, and transference. I will mostly follow the final chapter of my upcoming book, available at https://yufeizhao.com/gtacbook/. Some prior familiarity with the graph regularity lemma (§2.1), as well as the cut norm and counting lemma for graphons (§4.2 & 4.5) may be helpful for following the talk.

四、主讲人简介

Yufei Zhao joined the mathematics faculty in MIT as Assistant Professor in July 2017. Zhao's main research area is combinatorics. He is interested in extremal, probabilistic, and additive problems in combinatorics, as well as connections to other areas of mathematics and theoretical computer science. He has been developing tools that connect graph theory with additive combinatorics. Zhao has received the SIAM Dénes Kőnig prize (2018), the MIT Future of Science Award by the School of Science (2018), the Class of 1956 Career Development Professorship (2018–2021), the Sloan Research Fellowship (2019), and the NSF CAREER Award (2021).

五、邀请人

王光辉 数学学院教授

六、时间

6月15日（周三）9:00-11:00

七、地点

Zoom会议

八、联系人

常帆，联系方式：cf25264@163.com

九、主办

山东大学数学学院