Spread approximations and intersection problems
组织者
本杰明·苏达科夫
演讲者
Andrey Kupavskii
时间
2025年05月20日 17:05 至 18:15
地点
Online
线上
Zoom 787 662 9899
(BIMSA)
摘要
We discuss recent progress on different intersection questions for different collections of objects, which was obtained using the spread approximation method. The method was introduced by Kupavskii and Zakharov and developed in a series of subsequent works. As an example, we will discuss a recent result on intersecting families of spanning trees by Frankl, Hurlbert, Ihringer, Kupavskii, Lindzey, Meagher, and Raghu Tej Pantangi. We will also discuss some further ideas and tools that were introduced to the method in the works of Kupavskii on t-intersecting families of permutations and the work of Kupavskii and Noskov on forbidden sunflowers.
演讲者介绍
Andrey Kupavskii, 35 years old, head of the Laboratory of Combinatorial and Geometric structures and Laboratory of Discrete and Geometric Structures at MIPT. Some previous positions: postdoc at EPFL, Oxford, IAS Princeton.