Binary-alphabet extremal conjecture for abelian-square factors
Statement
For a finite word, an abelian-square factor is a factor formed by concatenating two anagrams of one another. Let be a positive integer, and let be the number of distinct abelian-square factors in a word of length . Binary-alphabet extremal conjecture. If a word of length contains distinct abelian-square factors, then there exists a binary word of length containing at least distinct abelian-square factors. This conjecture asserts that binary words attain the maximum possible number of distinct abelian-square factors among words of each fixed length; the source leaves it as an open question.
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.