Videos of talks

Xuancheng Shao - Gowers uniformity of primes in arithmetic progressions and in short intervals

Péter Pál Pach - Polynomial Schur’s theorem

Sarah Peluse - Bounds for sets lacking x, x + y, x + y2

Nina Kamcev - Finding monochromatic combinatorial lines with few intervals

Joel Moreira - The Erdös sumset conjecture

Sofia Lindqvist - Rado’s criterion over squares and higher powers

Jacob Fox - A solution to the Burr-Erdös problems on Ramsey completeness

Katherine Staden - Erdös-Rothschild problems in graphs, groups and the integers

Oliver Janzer - Improved bounds for the Erdös-Rogers function

Ben Barber - The Namer–Claimer game

Thomas Bloom - Logarithmic bounds for Roth's theorem via almost-periodicity

Tom Sanders - The Erdös-Moser sum-free set problem