Compositional equivalences for pairs of length-four patterns

From papers

Let Cn(τ,τ)C_n(\tau,\tau') be the set of all compositions of nn that avoid the patterns τ\tau and τ\tau', and let cn(τ,τ)=Cn(τ,τ)c_n(\tau,\tau')=|C_n(\tau,\tau')|. Compositional equivalence conjecture. If n1n\geq 1, then

cn(121,1342)=cn(121,3142)andcn(212,3124)=cn(212,3142).c_n(121,1342)=c_n(121,3142) \quad\text{and}\quad c_n(212,3124)=c_n(212,3142).

These two equalities assert compositional equivalences that the authors' enumeration data suggest but that they are unable to prove by their present methods.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Vít Jelínek, Toufik Mansour, José L. Ramírez and Mark Shattuck, “Avoiding a pair of patterns in multisets and compositions”, arXiv:2111.06185 (2021).

Solutions 0

No solutions have been posted yet.