From The Center of Mathematical Sciences and Applications Workshop on Algebraic Methods in Combinatorics, held November 13-17.
Speaker: Laszlo Miklós Lovasz (UCLA)
Abstract: In this talk, we will discuss recent work on Green’s problem. For triangles, we prove an essentially tight bound for Green’s arithmetic triangle removal lemma in F_p^n, using the recent breakthroughs with the polynomial method. For k-cycles, we also prove a polynomial bound, however, the question of the optimal exponent is still open.
The triangle case is joint work with Jacob Fox, and the k-cycle case with Jacob Fox and Lisa Sauermann.
Ещё видео!