ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A polynomial method proof of Frankl-Rodl theorem

The Frankl-Rodl theorem is the following: let A⊂F2nA\subset \mathbb{F}_2^n be so that A+AA+A does not contain any element with hamming weight kk for some kk satisfying Clog⁡α−1n≤k≤n−Clog⁡α−1nC\sqrt[]{\log \alpha^{-1}n}\leq k\leq n-C\sqrt[]{\log \alpha^{-1}n}. Then AA has density at most α\alpha.

Find a proof of Frankl-Rodl theorem using the polynomial method, in particular Croot-Lev-Pach method.

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.