ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an alphabet with kk letters, let d(W)d(W) be the minimum number of single square reductions needed to turn a word WW into a square-free word, and let dk(n)d_k(n) be the maximum value of d(W)d(W) over words of length nn. Limit-existence conjecture. For every k⩾2k\geqslant 2, the limit

lim⁡n→∞dk(n)n\lim_{n\rightarrow\infty}\frac{d_k(n)}{n}

exists. For k=2k=2, this limit is known to exist and is bounded between 0.0450.045 and 0.40.4; existence for larger alphabets, including k=3k=3, remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.