Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Following \cite{BCS}, let (respectively; ) be the number of the occurrences of the generalized pattern (respectively; ) in . In the present note, we study the distribution of the statistics and in a permutation avoiding the classical pattern . Also we present an applications, which relates the Narayana numbers, Catalan numbers, and increasing subsequences, to permutations avoiding the classical pattern according to a given statistics on , or on .

生成讲解博客的中文版本

生成AI智能校验的中文版本