Independence conjecture for almost-prime patterns

About 2 years old · traced to

Let Pℓ\mathbb{P}_\ell denote the set of integers with the relevant almost-prime parameter ℓ\ell, let \1Pℓ\1_{\mathbb{P}_\ell} be its indicator, and let π‾ℓ(N)\overline{\pi}_\ell(N) denote its normalized counting function on [N][N]. Write [N]={1,…,N}[N]=\{1,\ldots,N\} and En∈[N]f(n)=N−1∑n=1Nf(n)\mathbb{E}_{n\in[N]}f(n)=N^{-1}\sum_{n=1}^Nf(n). Independence conjecture for almost primes. For all k∈Nk\in\mathbb{N},

∑ℓ1,…,ℓk=1∞∣En∈[N]\1Pℓ1(n)\1Pℓ2(n+1)⋯\1Pℓk(n+k−1)−π‾ℓ1(N)⋯π‾ℓk(N)∣=oN→∞(1).\sum_{\ell_1,\ldots,\ell_k=1}^{\infty}\left|\mathbb{E}_{n\in[N]}\1_{\mathbb{P}_{\ell_1}}(n)\1_{\mathbb{P}_{\ell_2}}(n+1)\cdots\1_{\mathbb{P}_{\ell_k}}(n+k-1)-\overline{\pi}_{\ell_1}(N)\cdots\overline{\pi}_{\ell_k}(N)\right|=o_{N\to\infty}(1).

This conjecture would imply the expected asymptotic independence for almost-prime patterns for almost all parameters in the typical range, and the paper notes that it implies the functional Chowla conjecture. Its general validity remains open.

References

Primary source

Dimitrios Charamaras and Florian K. Richter, “Asymptotic independence of Ω(n) and Ω(n+1) along logarithmic averages”, arXiv:2412.17583 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.