ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp and qq be binary words. They are strongly Wilf-equivalent if Bn,p(k)=Bn,q(k)B_{n,p}(k)=B_{n,q}(k) for all n,k≥0n,k\geq 0, 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 pp and qq 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 pp and qq 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 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.