ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime and let B⊂FpB\subset\mathbb{F}_p be a set, with pp and ∣B∣|B| large. Write B.B={bb′:b,b′∈B}B.B=\{bb':b,b'\in B\}, and let an arithmetic progression (AP) in B.BB.B mean a set of the form {a,a+d,…,a+(L−1)d}\{a,a+d,\ldots,a+(L-1)d\} with d≠0d\ne 0.

Finite-field product-set conjecture. There is an absolute constant c>0c>0 such that, whenever

∣B∣<cp,|B|<c\sqrt p,

the product set B.BB.B cannot contain an arithmetic progression of size greater than ∣B∣1+o(1)|B|^{1+o(1)}.

Sets BB of size O(p)O(\sqrt p) can have B.B=FpB.B=\mathbb{F}_p, so the restriction to smaller sets is essential. The conjecture proposes an essentially linear upper bound, up to the factor ∣B∣o(1)|B|^{o(1)}, 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 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.