The bound on lengths of perfectly clustering words in Gessel's map
Statement
Let and let be an -tuple of nonnegative integers. Let be the map from words to multisets of conjugacy classes of primitive words described above. Length bound conjecture. The number of distinct lengths of conjugacy classes of words appearing in is at most
This conjecture concerns the possible lengths of the conjugacy classes arising from the map and was expressed in the second author's thesis. Its resolution is not specified in the source.
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.