Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 73 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Kimi K2 190 tok/s Pro
2000 character limit reached

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds (1808.04965v2)

Published 15 Aug 2018 in math.CO

Abstract: The Bogolyubov-Ruzsa lemma, in particular the quantitative bounds obtained by Sanders, plays a central role in obtaining effective bounds for the inverse $U3$ theorem for the Gowers norms. Recently, Gowers and Mili\'cevi\'c applied a bilinear Bogolyubov-Ruzsa lemma as part of a proof of the inverse $U4$ 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}_pn \times \mathbb{F}_pn$ has density $\alpha$, 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)} \alpha{-1}$. This improves the results of Gowers and Mili\'cevi\'c which obtained similar results with a weaker bound of $r=\exp(\exp(\log{O(1)} \alpha{-1}))$ and by Bienvenu and L^e which obtained $r=\exp(\exp(\exp(\log{O(1)} \alpha{-1})))$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.