Quantitative bounds in the polynomial Szemerédi theorem
Statement
Given polynomials with , prove quantitative upper bounds for the largest subset containing no nontrivial configurations of the form with .
Record
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.