A probabilistic language-free proof of an explicit Croot-Laba-Sisask Lemma
Number Theory
2022-12-13 v1 Probability
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.
Keywords
Cite
@article{arxiv.2212.05920,
title = {A probabilistic language-free proof of an explicit Croot-Laba-Sisask Lemma},
author = {Olivier Ramaré},
journal= {arXiv preprint arXiv:2212.05920},
year = {2022}
}