arXiv · 2212.05920
A probabilistic language-free proof of an explicit Croot-Laba-Sisask Lemma
Abstract
This note proposes a probabilistic language-free proof of the famous Croot-Laba-Sisask Lemma. In between, we do the same for the Khintchine and Marcinkiewicz-Zygmund inequalities and explicitate the implied constants.
Explore related subjects
Keep this discovery
Olivier Ramaré. 2022-12-09. A probabilistic language-free proof of an explicit Croot-Laba-Sisask Lemma. https://arxiv.org/abs/2212.05920
Cite the original work for its findings. Save a collection to share your selection of sources.