Abstract

In this paper, we study pattern avoidance on the set of biwords with no repetitions in each block and prove that the number of those biwords avoiding π‾ is independent of the choice of π∈S3, which extends Knuth's classic result on permutations avoiding π∈S3. We present the proof in both bijective and inductive methods. As applications, we will give new combinatorial interpretations on Catalan, Riordan, and Motzkin numbers via pattern avoidance of biwords. Using the elementary theory of symmetric functions, we investigate the generating functions of biwords avoiding several specific patterns.

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.