Compositional equivalences for pairs of length-four patterns
Let be the set of all compositions of that avoid the patterns and , and let . Compositional equivalence conjecture. If , then
These two equalities assert compositional equivalences that the authors' enumeration data suggest but that they are unable to prove by their present methods.
References
- 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).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.