The true complexity of a system of linear equations
The true complexity of a system of linear equations
In this paper we look for conditions that are sufficient to guarantee that a subset A of a finite Abelian group G contains the 'expected' number of linear configurations of a given type. The simplest non-trivial result of this kind is the well-known fact that if G has odd order, …