Strong Wilf-equivalence is characterized by trivial equivalence for binary words
Statement
Let and be binary words. They are strongly Wilf-equivalent if for all , and they are trivially equivalent when they are related by the trivial equivalence defined earlier in the paper.
Strong Wilf-equivalence conjecture. Two binary words and are strongly Wilf-equivalent if and only if they are trivially equivalent.
Strong Wilf-equivalence refines ordinary Wilf-equivalence, since words of the same length are Wilf-equivalent. The paper notes that strong Wilf-equivalence forces and to have the same length and the same number of runs of each size, while computations suggest that trivial equivalence gives all such equivalences.
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.