= Ernie Croot
{c}
<Ernie Croot> and <Olof Sisask> introduced a sampling technique for approximate translation invariance in <additive combinatorics>. Their <Croot-Sisask almost-periodicity theorem> controls how much a <convolution> changes under many translations.<A probabilistic technique for finding almost-periods of convolutions by Ernie Croot and Olof Sisask>[Original byline and propositions 1.1 and 1.3]{ref}
The useful shift is from exact algebraic symmetry to small error in a function norm. Random samples approximate averages; comparing repeated approximations exposes almost-periods. The original paper carefully specifies counting convolution and counting $L^p$ norms, which determine the constants and scale of the assertion.<A probabilistic technique for finding almost-periods of convolutions by Ernie Croot and Olof Sisask>[Sections 1.1 and 3]{ref}
Back to article page
