Journal ArticleOPEN ACCESS

Counting occurrences of 132 in a permutation

Advances in Applied Mathematics (2002) 28(2) 185-195
DOI: 10.1006/aama.2001.0773
24Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the generating function for the number of permutations on n letters containing exactly r ≥ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r. © 2002 Elsevier Science (USA).

Cite

CITATION STYLE

APA

Mansour, T., & Vainshtein, A. (2002). Counting occurrences of 132 in a permutation. Advances in Applied Mathematics, 28(2), 185–195. https://doi.org/10.1006/aama.2001.0773

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free