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.[ref]
The Croot-Sisask almost-periodicity theorem finds many translations changing a convolution by only a small amount in an 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.[ref]
Articles by others on the same topic
There are currently no matching articles.