counting occurrences of in an even permutation计算中出现的排列.pdfVIP

IJMMS 2004:25, 1329–1341 PII. S0161171204304114 © Hindawi Publishing Corp. COUNTING OCCURRENCES OF 132 IN AN EVEN PERMUTATION TOUFIK MANSOUR Received 9 April 2003 We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of a 132 pattern. It is shown that finding this function for a given r amounts to a routine check of all permutations in S 2r . 2000 Mathematics Subject Classification: 05A05, 05A15, 05C90. 1. Introduction. Let [n] = {1, 2,...,n} and let Sn denote the set of all permutations of [n]. We will view permutations in Sn as words with n distinct letters in [n]. A pattern is a permutation σ ∈ S , and an occurrence of σ in a permutation π = π π ···π ∈ S k 1 2 n n is a subsequence of π that is order equivalent to σ . For example, an occurrence of 213 is a subsequence π π π (1 ≤ i j k ≤ n) of π such that π π π . We denote i j k j i k by τ(π) the number of occurrences of τ in π , and we denote by sr (n) the number of σ permutations π ∈ Sn such that σ (π) = r . In the last decade much attention has been paid to the problem of finding the num- bers sr (n) for a fixed r ≥ 0 and a given pattern τ (see [1, 2, 3, 5, 6, 7, 10, 11, 14, 15, σ 16, 17, 18, 19]). Most of the authors consider only the case r = 0, thus studying per- mutations avoiding a given pattern. Only a few papers consider the case r 0, usually restricting themselves to patterns of length 3. Using two simple involutions ( reverse and