Generalized Uniformness Conjecture for Kolakoski sequences

Let m,n>0m,n>0 with m+nm+n odd, and let K(m,n)K(m,n) be the unique infinite sequence with values in {m,n}\{m,n\} and first term mm. For an integer k0k\geq 0, define sequences t(i)t^{(i)} for i1i\geq 1 recursively by

t(1)=mk,t(i+1)=C(K(m,n)i,t(i)).t^{(1)}=m^k,\qquad t^{(i+1)}=C(K(m,n)_i,t^{(i)}).

Here CC is the sequence operation used in the paper, K(m,n)iK(m,n)_i denotes the iith term of K(m,n)K(m,n), and mkm^k denotes the length-kk sequence consisting of kk copies of mm. For x{m,n}x\in\{m,n\} and t{m,n}kt\in\{m,n\}^k, let SS be the subset of N\mathbb N consisting of all ii such that K(m,n)i=xK(m,n)_i=x and t(i)=tt^{(i)}=t.

Generalized Uniformness Conjecture. The asymptotic density of SS equals 2k12^{-k-1}.

For k=0k=0, m=1m=1, and n=2n=2, this reduces to the classical conjecture that the limiting density of 11 in the Kolakoski sequence is 1/21/2. The paper presents a partial result, but the general conjecture remains open.

Sources & referencesView supporting material

Primary source

Bobby Shen, “A uniformness conjecture of the Kolakoski sequence, graph connectivity, and correlations”, arXiv:1703.00180 (2017).

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.