Conjecture on Zeckendorf sum-of-digits maximum order complexity along polynomial subsequences
Let denote the sum of digits of in Zeckendorf base, let , and let be the sequence obtained by restricting to a polynomial subsequence , where has degree . Write for its maximum order complexity up to length . Zeckendorf polynomial-subsequence conjecture. There are constants such that, for all sufficiently large ,
Equivalently, . The paper proves the corresponding lower bound, so the conjecture asserts its sharpness; computational evidence is given for squares.
References
- 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
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.