Abstract

We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet { 1 , 2 } and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.