Counting occurrences of 132 in a permutation

Advances in Applied Mathematics

Volumn 28, Issue 2, 2002, Pages 185-195

  Mansour, Toufik ^a   Vainshtein, Alek ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036225910     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.2001.0773     Document Type: Article

References (6)

1. The number of permutations with exactly r 132-subsequences is P-recursive in the size!
2. Permutations with one or two 132-subsequences
3. Forbidden subsequences and Chebyshev polynomials
4. Restricted permutations, continued fractions, and Chebyshev polynomials
5. The number of permutations containing exactly one increasing subsequence of length three
6. The enumeration of permutations with a prescribed number of "forbidden" patterns