The factor-complexity and critical-exponent conjecture for morphic images of G
The factor-complexity and critical-exponent conjecture for morphic images of G
From papers
Let , where , and let be its critical exponent. For each morphism in Table~, consider the infinite word . Morphic-image conjecture. For each such morphism , the word has factor complexity and critical exponent . These are presented as open problems in the source; the conjecture concerns preservation of both invariants under the listed morphisms.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
James D. Currie, “Words with factor complexity 2n+1 and minimal critical exponent”, arXiv:2507.09387 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.