Sing's generalized power-law conjecture for f-smooth-word complexity
Let be a binary alphabet, let be the set of finite f-smooth words over , and let denote its factor complexity. Define
Sing's power-law conjecture. Over ,
The conjecture generalizes the original case; polynomial bounds and partial results are known, but the full asymptotic estimate is not established.
References
- Julien Cassaigne and Raphaël Henry, “The complexity of smooth words over binary alphabets”, arXiv:2603.10733 (2026).
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.