Conjecture on successive-step ratios for Thue–Morse and Zeckendorf complexity
Conjecture on successive-step ratios for Thue–Morse and Zeckendorf complexity
For a sequence , let a step be an integer at which its maximum order complexity changes from to , and define the ratio of successive steps using consecutive steps with no intermediate complexity value. Let . Successive-step ratio conjecture. The ratio of successive steps tends to for a sequence related to the Thue–Morse sequence and tends to for the sequence related to the Zeckendorf sum of digits.
This conjecture concerns the observed asymptotic spacing of complexity jumps and is supported by numerical experimentation; no proof or resolution is supplied in the paper.
Sources & referencesView supporting material
Primary source
Damien Jamet, Pierre Popoli and Thomas Stoll, “Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences”, arXiv:2106.09959 (2021).
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.