Parity, polynomial rank, and an exact prime-distance case
Statement
A polynomial method proof of Frankl-Rodl theorem
The Frankl-Rodl theorem is the following: let be so that does not contain any element with hamming weight for some satisfying . Then has density at most .
Find a proof of Frankl-Rodl theorem using the polynomial method, in particular Croot-Lev-Pach method.
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.