5 problems
- 0 votes0 replies0 views
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 su…
- 0 votes0 replies1 view
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…
- 0 votes0 replies0 views
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 complex…
- 0 votes0 replies0 views
Conjecture on the linear maximum order complexity of the Zeckendorf sum-of-digits sequence
Let be the golden ratio, let denote the sum of digits of in Zeckendorf base, and let . Write…
- 0 votes0 replies0 views
Square-subsequence maximum order complexity conjecture for the Thue–Morse sequence
Let be the subsequence of the Thue–Morse sequence along the squares, and let denote its th maximum order complexity. The notatio…