ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and ℓ\ell be multiplicatively independent positive integers. A subset of N\mathbb{N} is sparse if its counting function is bounded by O((log⁡x)d)O((\log x)^d) for some dd. Let X⊆NX\subseteq\mathbb{N} be sparse and kk-automatic, and let Y⊆NY\subseteq\mathbb{N} be zero-density and ℓ\ell-automatic. Sparse–zero-density intersection conjecture. The intersection X∩YX\cap Y is finite. The heuristic in the source uses the polynomial decay of the density of YY together with the rapidly growing enumeration of the sparse set XX; the conjecture is presented as beyond current methods in number theory.

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.