The finite-field product-set arithmetic progression conjecture
Statement
Let be a prime and let be a set, with and large. Write , and let an arithmetic progression (AP) in mean a set of the form with .
Finite-field product-set conjecture. There is an absolute constant such that, whenever
the product set cannot contain an arithmetic progression of size greater than .
Sets of size can have , so the restriction to smaller sets is essential. The conjecture proposes an essentially linear upper bound, up to the factor , for the length of an arithmetic progression in a finite-field product set.
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.