Type: Article
Publication Date: 2017-10-25
Citations: 2
DOI: https://doi.org/10.1090/tran/7432
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 a metric, convergence and limit objects for functions on discrete groups and use it to study limits of measurable functions on compact abelian groups. As an application we find exact minimizers for densities of linear configurations of complexity $1$.