A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds

DOI10.19086/da.8867zbMath1479.11031arXiv1808.04965OpenAlexW3098254841MaRDI QIDQ5211009

Kaave Hosseini, Shachar Lovett

Publication date: 17 January 2020

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.04965

zbMATH Keywords

sumsetsadditive combinatoricsbilinear setsBogolyubov-Ruzsa lemma

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (3)

A bilinear version of Bogolyubov’s theorem ⋮ LINEAR AND QUADRATIC UNIFORMITY OF THE MÖBIUS FUNCTION OVER ⋮ A note on extensions of multilinear maps defined on multilinear varieties

Cites Work

• Unnamed Item
• Unnamed Item
• Equivalence of polynomial conjectures in additive combinatorics
• On the Bogolyubov-Ruzsa lemma
• ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
• An equivalence between inverse sumset theorems and inverse conjectures for theU³norm
• The structure theory of set addition revisited
• LINEAR AND QUADRATIC UNIFORMITY OF THE MÖBIUS FUNCTION OVER
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM

This page was built for publication: A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds