An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language

DOI10.1007/S00574-024-00397-5WikidataQ126009873 ScholiaQ126009873MaRDI QIDQ6497015FDOQ6497015

Authors: Olivier Ramaré 

Publication date: 6 May 2024

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Recommendations

• An entropic proof of Chang's inequality
• Covering the large spectrum and generalized Riesz products
• Szemerédi's regularity lemma via martingales
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• Sums of multiplicative characters with additive convolutions

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Abstract harmonic analysis (43Axx)

Cites Work

• Title not available (Why is that?)
• The best constants in the Khintchine inequality
• A probabilistic technique for finding almost-periods of convolutions
• Aspects of the Kahane-Salem-Zygmund inequalities in Banach spaces
• The Rademacher system in function spaces
• On the best constant in Marcinkiewicz-Zygmund inequality
• On superorthogonality
• Arithmetic progressions in sumsets and \(L^p\)-almost-periodicity
• Coefficients of multilinear forms on sequence spaces
• Optimal constants in the Marcinkiewicz-Zygmund inequalities

This page was built for publication: An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497015)