Pattern avoidance of generalized permutations

Abstract

In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding π is independent of the choice of π ∈ S 3 , which extends the classic results on permutations avoiding π ∈ S 3 . Extending both Dyck path and Riordan path, we introduce the Catalan-Riordan path which turns out to be a combinatorial interpretation of the difference array of Catalan numbers. As applications, we interpret both Motzkin and Riordan numbers in two ways, via semistandard Young tableaux of two rows and generalized permutations avoiding π ∈ S 3 . Analogous to Lewis's method, we establish a bijection from generalized permutations to rectangular semistandard Young tableaux which will recover several known results in the literature.