Asymptotic growth of shuffle squares over large alphabets
Statement
For , let and let be the set of words in that can be partitioned into two disjoint, identical subwords. A word in is a shuffle square, and is its semi-length. Since is supermultiplicative in , define
Large-alphabet shuffle-square growth conjecture. As a function of ,
The conjecture proposes that the known upper bound is essentially tight for large fixed alphabets. The binary case is solved by the paper's main theorem, while the corresponding behavior for larger alphabets remains open; in particular, the paper separately asks whether .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.