Limiting-function conjecture for normalized kk-mer minimizer counts

Let Σ\Sigma be the underlying alphabet, and for each k,mk,m let fk,m:[0,1][0,1]f_{k,m}:[0,1]\to[0,1] be the piecewise linear function determined by the points p(w)=(x,y)p(w)=(x,y) for wΣmw\in\Sigma^m, with fk,m(x)=yf_{k,m}(x)=y, together with fk,m(0)=1f_{k,m}(0)=1 and fk,m(1)=0f_{k,m}(1)=0. Limiting-function conjecture. There exists a function f:[0,1][0,1]f_\infty:[0,1]\to[0,1] such that (fk,m)(f_{k,m}) converges to ff_\infty in a sense to be determined as k,mk,m\to\infty. The conjecture records numerical evidence of a common limiting profile, but the mode of convergence and the existence of the limit remain unspecified.

Sources & referencesView supporting material

Primary source

Florian Ingels, Camille Marchet and Mikaël Salson, “On the number of k-mers admitting a given lexicographical minimizer”, arXiv:2412.17492 (2024).

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.