The complexity bound conjecture for S(e,23,e)-adic languages
Let be an -adic language, and let denote its factor-complexity function.
Complexity bound conjecture. The complexity function for any -adic language satisfies
This would extend the paper's classification of TRIP maps whose associated -adic languages have complexity bounded above by to the remaining map family and its twins and conjugates.
References
- Thomas Garrity and Otto Vaughn Osterman, “On the Factor Complexity Associated with a Family of Multidimensional Continued Fraction Algorithms”, arXiv:2410.02032 (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.