Search arXivSearch

arXiv · 1808.04965

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds

Abstract

The Bogolyubov-Ruzsa lemma, in particular the quantitative bounds obtained by Sanders, plays a central role in obtaining effective bounds for the inverse $U^3$ theorem for the Gowers norms. Recently, Gowers and Milićević applied a bilinear Bogolyubov-Ruzsa lemma as part of a proof of the inverse $U^4$ theorem with effective bounds. The goal of this note is to obtain quantitative bounds for the bilinear Bogolyubov-Ruzsa lemma which are similar to those obtained by Sanders for the Bogolyubov-Ruzsa lemma. We show that if a set $A \subset \mathbb{F}_p^n \times \mathbb{F}_p^n$ has density $α$, then after a constant number of horizontal and vertical sums, the set $A$ would contain a bilinear structure of co-dimension $r=\log^{O(1)} α^{-1}$. This improves the results of Gowers and Milićević which obtained similar results with a weaker bound of $r=\exp(\exp(\log^{O(1)} α^{-1}))$ and by Bienvenu and Lê which obtained $r=\exp(\exp(\exp(\log^{O(1)} α^{-1})))$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaave Hosseini, Shachar Lovett. 2019-06-12. A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds. https://doi.org/10.19086/da.8867

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO