Balazs Szegedy
Published 2015-02-27Version 1
Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for measurable functions on compact abelian groups. As an application we find exact minimizers for densities of linear configurations of complexity $1$.
Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds
Limits of Latin squares
On sets with missing differences in compact abelian groups
![QR code for arXiv:1502.07861 [math.CO]](http://oss.arxitics.com/images/favicon.svg)