Jamet, Popoli, and Stoll's maximum order complexity conjecture for the Fibonacci-Thue-Morse sequence
Jamet, Popoli, and Stoll's maximum order complexity conjecture for the Fibonacci-Thue-Morse sequence
Let be the golden ratio, let be the Fibonacci-Thue-Morse sequence, and let denote its maximum order complexity at length . Jamet, Popoli, and Stoll's conjecture.
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 , 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.