ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ε>0\varepsilon>0, let pp be a prime, and let A⊂Fp∖{0}A\subset\mathbb{F}_p\setminus\{0\}. A nonempty set X⊂FpX\subset\mathbb{F}_p satisfies the required affine almost-invariance conditions when

∣a⋅X∖X∣≤ε∣X∣and∣(a+X)∖X∣≤ε∣X∣|a\cdot X\setminus X|\leq\varepsilon|X|\quad\text{and}\quad |(a+X)\setminus X|\leq\varepsilon|X|

for every a∈Aa\in A, where a⋅X={ax:x∈X}a\cdot X=\{ax:x\in X\} and a+X={a+x:x∈X}a+X=\{a+x:x\in X\}. The affine almost-invariance lower-bound conjecture. For every ε>0\varepsilon>0, there is a constant cε>0c_\varepsilon>0 such that, for every positive integer k≤cεlog⁡log⁡pk\leq c_\varepsilon\log\log p and every prime pp, there is a set A⊂Fp∖{0}A\subset\mathbb{F}_p\setminus\{0\} with ∣A∣=k|A|=k such that every nonempty X⊂FpX\subset\mathbb{F}_p satisfying these conditions has

∣X∣≥exp⁡(exp⁡(cεk)).|X|\geq\exp\bigl(\exp(c_\varepsilon k)\bigr).

This conjecture predicts that the doubly exponential dependence in the affine construction cannot be improved; the supplied text does not establish its resolution.

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.