ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A stronger BSG theorem

The standard BSG theorem is as follows: let E(A)=∣{(a,b,c,d)∈A4:a+b=c+d}∣E(A) = |\{(a,b,c,d)\in A^4: a+b=c+d\}|. If E(A)∣A∣3≥1K\frac{E(A)}{|A|^3}\geq \frac{1}{K} then there is a subset A′⊂AA'\subset A so that ∣A′∣≥∣A∣K100|A'|\geq \frac{|A|}{K^{100}} and ∣A′+A′∣≤K100∣A′∣|A'+A'|\leq K^{100}|A'|. One of the drawbacks of BSG theorem is that we lose control on E(A′)E(A'). Can we have a stronger BSG theorem as follows?

Let A⊂GA\subset G, and suppose E(A)≥∣A∣3KE(A)\geq \frac{|A|^3}{K}. Then there is a set A′⊂AA'\subset A so that ∣A′∣≥∣A∣K100,|A'|\geq \frac{|A|}{K^{100}}, ∣A′+A′∣≤K100∣A′∣,|A'+A'|\leq K^{100}|A'|, E(A′)∣A′∣3≥E(A)∣A∣3\frac{E(A')}{|A'|^3}\geq \frac{E(A)}{|A|^3} Can we moreover obtain the following? E(A′)∣A′∣3≥E(A)∣A∣3(∣A∣∣A′∣)1100\frac{E(A')}{|A'|^3}\geq \frac{E(A)}{|A|^3} \left(\frac{|A|}{|A'|}\right)^{\frac{1}{100}}

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.