= Kevin Henriot
{c}
<Kevin Henriot> works on <additive combinatorics>. His authored <Notes on the Croot-Sisask lemma by Kevin Henriot> explain a sampling method for finding approximate translation symmetries of convolutions. The author publication page identifies these as expository notes.https://khenriot.wordpress.com/expository/[Author's expository publication list]{ref}
The <Croot-Sisask almost-periodicity theorem> finds many translations changing a <convolution> by only a small amount in an $L^p$ norm. Replacing a large average by a random sample makes the argument probabilistic; moment estimates control its error. Henriot's account develops this functional formulation with explicit counting-norm conventions.<Notes on the Croot-Sisask lemma by Kevin Henriot>[Theorem 2 and sections 2 and 4]{ref}
Back to article page
