Let be an integer, be an abelian group and be functions with finite, non-empty supports. Define the generalised additive energy Moreover, for every , let . A standard Fourier analytic argument delivers the estimate In this note, we present a purely combinatorial proof of the above inequality. In particular, our proof does not use any Fourier or spectral analysis and relies on repeated applications of Cauchy–Schwarz inequality combined with a discrete convexity extension type argument. We also record a variation of this upper bound in the non-abelian setting via spectral inequalities following work of Hatami on graph norms, as well as a relevant sumset analogue obtained via iterative applications of the Pl"{u}nnecke–Ruzsa inequality.

生成讲解博客的中文版本

生成AI智能校验的中文版本