Spread Approximations in Extremal Set Theory
报告专家：Andrey Kupavskii（Moscow Institute of Physics and Technology，MIPT）
报告时间：
4月1日9:30-11:30，14:30-16:30；4月6日14:30-16:30；
4月7日9:30-11:30；4月8日、4月10日14:30-16:30
报告地点：线下：四川大学数学学院西303报告厅；线上：腾讯会议号：362-7155-3417
报告摘要：
The spread approximation, recently introduced by Kupavskii and Zakharov, stands as one of the most important methods in extremal set theory. It builds upon the breakthrough work of Alweiss, Lovett, Wu, and Zhang on the Erdős–Rado Sunflower Conjecture. In 2011, Ellis, Friedgut, and Pilpel [J. Amer. Math. Soc.] established the Erdős–Ko–Rado theorem for symmetric groups. Their proof relies on Fourier analysis on the symmetric group, which involves representation theory. Surprisingly, using spread approximations, Kupavskii and Zakharov provided a short, algebraic-structure-free proof of the Ellis–Friedgut–Pilpel theorem. This approach has stimulated further advances in extremal set theory.
In this mini-course, we will discuss the spread approximation method and its development in a series of subsequent works. We cover the basic method and its variations, possibly including the recent iterative spread approximation approach. We will discuss the applications of the method in the domain of sets and other structures, notably, permutations.
专家简介：
Andrey Kupavskii，2013年博士毕业于莫斯科州国立大学(Moscow State University) , 2017年11月-2018年11月访问英国伯明翰大学（University of Birmingham），2018年12月-2019年8月访问英国牛津大学（University of Oxford），2019年9月-2020年8月访问美国高等研究院（Institute for Advanced Study），现为莫斯科物理技术学院组合几何组组长（Head of CombGeo Lab, MIPT）。主要研究兴趣有极值组合学、离散与计算几何、概率方法、布尔函数分析等；在Proc. LMS，Adv Math，IMRN，Combinatorica，JCTA, JCTB等杂志发表论文100余篇。
邀请人：王健
.jpg "kupavskii000-01-01(1).jpg")