Continued fractions and generalized patterns (Q1612761): Difference between revisions

The paper is concerned with the generating function of the numbers of permutations of \(n\) letters, which contain precisely \(r\) occurrences of some generalized pattern. A pattern \(\tau\) is simply a permutation of \(k\) letters; an occurrence of the pattern \(\tau\) in a permutation \(\pi\) (of \(n\geq k\) letters) is a subword \((\pi_{i_1},\dots,\pi_{i_k})\) of \(\pi\) which is order--isomorphic to \(\tau\). A generalized pattern introduces the additional condition that certain letters in the subword \((\pi_{i_1},\dots,\pi_{i_k})\) must be adjacent in \(\pi\). The resepctive generating functions are derived for several classes of generalized patterns. In particular, all generalized patterns of length 3 are dealt with. The generating functions thus obtained involve continued fractions and Chebyshev polynomials of the second kind.