ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pip_i denote the iith prime. Let Ck(n)C_k(n) be the subsets of {1,…,n}\{1,\ldots,n\} containing no k+1k+1 pairwise coprime integers, and let Ek(n)E_k(n) be the integers at most nn divisible by at least one of p1,…,pkp_1,\ldots,p_k. Polylogarithmic gap conjecture. For every k≥1k\ge1, there exist a constant ckc_k and a positive integer nkn_k such that, for all n≥nkn\ge n_k,

∣Ek(n)∣−max⁡A∈Ck(n)A⊈Ek(n)∣A∣≫n(log⁡log⁡n)ck.|E_k(n)|-\max_{\substack{A\in C_k(n)\\ A\not\subseteq E_k(n)}}|A|\gg \frac{n}{(\log\log n)^{c_k}}.

This predicts a quantitative separation between the extremal family Ek(n)E_k(n) and every admissible family not contained in it. The paper notes that the corresponding lower bounds are proved for k=1,2k=1,2, while the assertion for every kk remains open.

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.