Jamet, Popoli, and Stoll's maximum order complexity conjecture for the Fibonacci-Thue-Morse sequence

Let α=(1+5)/2\alpha=(1+\sqrt{5})/2 be the golden ratio, let ftm\bf ftm be the Fibonacci-Thue-Morse sequence, and let Mftm(n)M_{\bf ftm}(n) denote its maximum order complexity at length nn. Jamet, Popoli, and Stoll's conjecture.

Mftm(n)n1+α2.M_{\bf ftm}(n)\sim\frac{n}{1+\alpha^2}.

This conjecture gives the expected asymptotic growth of the maximum order complexity of the Fibonacci-Thue-Morse sequence. The paper recalls a lower bound of order n/(α+α3)n/(\alpha+\alpha^3), but the conjectured asymptotic equivalence is not resolved in the supplied context.

Sources & referencesView supporting material

Primary source

Jeffrey Shallit, “Note on a Fibonacci Parity Sequence”, arXiv:2203.10504 (2022).

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.