ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For 0<σ<10<\sigma<1, define a (δ,σ)1(\delta,\sigma)_1-set to be a δ\delta-separated subset A⊂[1,2]A\subset[1,2] satisfying ∣A∣∼δ−σ|A|\sim\delta^{-\sigma} and ∣A∩I∣≲∣I∣σ∣A∣|A\cap I|\lesssim |I|^{\sigma}|A| for every interval II. Let N(B,δ)\mathcal{N}(B,\delta) denote the maximal cardinality of a δ\delta-separated subset of BB. Katz–Tao discretized sum-product conjecture. There exists c=c(σ)>0c=c(\sigma)>0 such that every (δ,σ)1(\delta,\sigma)_1-set A⊂[1,2]A\subset[1,2] satisfies

max⁡{N(A+A,δ),N(AA,δ)}≳δ−c∣A∣.\max\{\mathcal{N}(A+A,\delta),\mathcal{N}(AA,\delta)\}\gtrsim \delta^{-c}|A|.

This is a discretized analogue of the Erdős–Szemerédi problem, with covering numbers replaced here by maximal separated-set cardinalities. The source attributes the question to Katz and Tao; its resolution status is not given in the supplied text.

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.