Conjecture on Thue–Morse maximum order complexity along polynomial subsequences
Let denote the Thue–Morse sequence along a polynomial subsequence, where is a polynomial of degree . Write for its maximum order complexity up to length . Thue–Morse polynomial-subsequence conjecture. There are constants such that, for all sufficiently large ,
Equivalently, . A proof would show that the previously proved lower bound is optimal; the claim is supported by computations for squares and cubes.
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.