An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language
Résumé
We provide an explicit and 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 for the upper bounds.
Origine | Fichiers produits par l'(les) auteur(s) |
---|