Freie Universität Berlin



Arithmetic removal lemmas and independent sets in hypergraphs


In the last years, several authors have studied sparse and random analogues of a wide variety of results in extremal combinatorics. Very recently, due to the work of Balogh, Morris, and Samotij, and the work of Saxton and Thomasson on the structure of independent sets on hypergraphs, several of these questions have been addressed in a new framework by using the so-called containers in hypergraphs.

In this talk I will present how to use this technology together with arithmetic removal lemmas due to Serra, Vena and Kral in the context of arithmetic combinatorics. We will show how to get sparse (and random) analogues of well-known additive combinatorial results even in the non-abelian situation.

This talk is based on a work in progress joint with Oriol Serra and Lluís Vena.


The Catalan Mathematical Society invites participants to this first congress of a biannual series focusing on current research topics across several areas of Mathematics.

Plenary talks and thematic sessions have been selected by the Scientific Committee of the SCM. Special thanks are due to the organisers of the thematic sessions and to the local mathematical community as a whole for their support to this congress.


Societat Catalana de Matemàtiques
Institut d'Estudis Catalans
Carrer del Carme, 47
08001 Barcelona

Phone: +34 933 248 583

Download a poster (high res)

Download a poster (low res)