Counting occurrences of 132 in an even permutation

Research output: Contribution to journalArticlepeer-review


We study the generating function for the number of even (or odd) permutations on n letters containing exactly r≥O 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 𝔖 2r.

Original languageEnglish
Pages (from-to)1329-1341
Number of pages13
JournalInternational Journal of Mathematics and Mathematical Sciences
Issue number25
StatePublished - 2004

ASJC Scopus subject areas

  • Mathematics (miscellaneous)


Dive into the research topics of 'Counting occurrences of 132 in an even permutation'. Together they form a unique fingerprint.

Cite this