Polylogarithmic gap conjecture for sets outside E_k
Statement
Let denote the th prime. Let be the subsets of containing no pairwise coprime integers, and let be the integers at most divisible by at least one of . Polylogarithmic gap conjecture. For every , there exist a constant and a positive integer such that, for all ,
This predicts a quantitative separation between the extremal family and every admissible family not contained in it. The paper notes that the corresponding lower bounds are proved for , while the assertion for every 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.