Polylogarithmic bilinear Bogolyubov conjecture

About 9 years old · traced to

Let VV be the ambient vector space, let P⊂V×VP\subset V\times V have density δ>0\delta>0, and let c(δ)c(\delta) be the constant in Theorem 1.1, which asserts that there are subspaces W1,W2≤VW_1,W_2\leq V and a family of bilinear forms on W1×W2W_1\times W_2 satisfying the stated containment, with max⁡(r1,r2,r3)≤c(δ)\max(r_1,r_2,r_3)\leq c(\delta). Polylogarithmic bilinear Bogolyubov conjecture. In Theorem 1.1, one can take

c(δ)=O(log⁡O(1)δ−1).c(\delta)=O\left(\log^{O(1)}\delta^{-1}\right).

The conjecture seeks a polylogarithmic bound in the density parameter for the bilinear Bogolyubov theorem, improving the triple-exponential bound stated there; the paper notes that its proof already gives such a bound for r1r_1 and r3r_3, while the symmetric role of r1r_1 and r2r_2 motivates the conjecture.

References

Primary source

Pierre-Yves Bienvenu and Thái Hoàng Lê, “A bilinear Bogolyubov theorem”, arXiv:1711.05349 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.