An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language
摘要
We provide an explicit and probabilistic language-free proof of the famous Croot-Łaba-Sisask Lemma. In between, we do the same for the Khintchine and Marcinkiewicz-Zygmund inequalities and explicitate the implied constants for the upper bounds.