Lluis Vena

Applications of the arithmetic removal lemma

The arithmetic removal lemma, which can be proven using the removal lemma for hypergraphs, states that a set with few solutions of a linear system can be made solution-free by removing few elements. In this talk we will discuss some of its applications and an extension of this result to linear systems over compact abelian groups.