北京雁栖湖应用数学研究院

马杰 , 本杰明·苏达科夫

Yuval Wigderson

2025年11月04日 17:05 至 18:15

Online

Zoom 787 662 9899 (BIMSA)

The regularity lemma says that every discrete object can be partitioned into a small number of random-like subobjects. But how small is small? And can we make small smaller if we assume that our given object is simple? And what does it mean for a discrete object to be simple? In this talk, I will answer some of these questions. 
Joint with Lior Gishboliner and Asaf Shapira.

Yuval Wigderson received his PhD under the supervision of Jacob Fox, studying extremal combinatorics and Ramsey theory. He has since held a postdoctoral position at Tel Aviv University, and is currently a Junior Fellow at the Institute for Theoretical Studies at ETH Zürich.