Asymptotic uniformity conjecture for constellations under the gap-cycle recursion

Let G(p){\mathcal G}(p) denote the cycle of gaps at a sieve stage, let ss be a constellation in G(p){\mathcal G}(p), and let σ(s)\sigma(s) be the sum of its gaps. Assume σ(s)<2p\sigma(s)<2p. Asymptotic uniformity conjecture. Under the recursion on the cycle of gaps, all such constellations tend toward a uniform distribution in G(P){\mathcal G}(P) for all primes PpP\gg p. This is the strengthened later formulation of the paper's uniformity assumption; the recursion suggests it, but no proof of the asserted convergence is supplied.

Sources & referencesView supporting material

Primary source

Fred B. Holt and Helgi Rudd, “Estimating constellations among primes - I. Uniformity”, arXiv:1312.2165 (2013).

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.