The factor-complexity and critical-exponent conjecture for morphic images of G

From papers

Let G=γω(0){\mathbf G}=\gamma^\omega(0), where γ=[01,2,02]\gamma=[01,2,02], and let μ\mu be its critical exponent. For each morphism hh in Table~, consider the infinite word h(G)h({\mathbf G}). Morphic-image conjecture. For each such morphism hh, the word h(G)h({\mathbf G}) has factor complexity 2n+12n+1 and critical exponent μ\mu. 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

No solutions have been posted yet.