The vanishing proportion conjecture for square-free M-unambiguous ternary and larger alphabets

About 8 years old · traced to

Let Σ\Sigma be an ordered alphabet with ∣Σ∣≥3|\Sigma|\ge 3. A word w∈Σ∗w\in\Sigma^* is square-free-MM-unambiguous when it is not MM-equivalent to any other distinct square-free word. Vanishing proportion conjecture.

lim⁡k→∞∣{w∈Σ∗:w is square-free-M-unambiguous and ∣w∣=k}∣∣{w∈Σ∗:w is square-free and ∣w∣=k}∣=0.\lim_{k\rightarrow\infty}\frac{|\{w\in\Sigma^*:w\text{ is square-free-$M$-unambiguous and }|w|=k\}|}{|\{w\in\Sigma^*:w\text{ is square-free and }|w|=k\}|}=0.

The conjecture is motivated by computations in the appendix showing that, up to length 6060, the proportion of square-free-MM-unambiguous words eventually decreases steadily. Its asymptotic assertion remains open in the source.

References

Primary source

Ghajendran Poovanandran, Adrian Atanasiu and Wen Chean Teh, “Parikh Motivated Study on Repetitions in Words”, arXiv:1807.06171 (2018).

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.