Counting occurrences of 132 in an even permutation

Toufik Mansour

doi:10.1155/S0161171204304114

Counting occurrences of 132 in an even permutation

Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 &Sfr; 2r.

Original language	English
Pages (from-to)	1329-1341
Number of pages	13
Journal	International Journal of Mathematics and Mathematical Sciences
Volume	2004
Issue number	25
DOIs	https://doi.org/10.1155/S0161171204304114
State	Published - 2004

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.1155/S0161171204304114

Cite this

@article{bc25ef37011e4b35aae2acc1b7df3e0c,

title = "Counting occurrences of 132 in an even permutation",

abstract = "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 \&Sfr; 2r.",

author = "Toufik Mansour",

year = "2004",

doi = "10.1155/S0161171204304114",

language = "English",

volume = "2004",

pages = "1329--1341",

journal = "International Journal of Mathematics and Mathematical Sciences",

issn = "0161-1712",

publisher = "John Wiley and Sons Ltd",

number = "25",

}

TY - JOUR

T1 - Counting occurrences of 132 in an even permutation

AU - Mansour, Toufik

PY - 2004

Y1 - 2004

N2 - 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 &Sfr; 2r.

AB - 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 &Sfr; 2r.

UR - https://www.scopus.com/pages/publications/17844398955

U2 - 10.1155/S0161171204304114

DO - 10.1155/S0161171204304114

M3 - Article

AN - SCOPUS:17844398955

SN - 0161-1712

VL - 2004

SP - 1329

EP - 1341

JO - International Journal of Mathematics and Mathematical Sciences

JF - International Journal of Mathematics and Mathematical Sciences

IS - 25

ER -

Counting occurrences of 132 in an even permutation

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this