Pattern avoidance and dominating compositions

From MaRDI portal



Abstract: Jel'inek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form sigma,au where sigma is a set partition of size 3 with at least two blocks. They obtained an upper bound for the number of Wilf-equivalence classes for such pairs. We show that their upper bound is the exact number of equivalence classes, thus solving a problem posed by them.












This page was built for publication: Pattern avoidance and dominating compositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097995)