Counting Occurrences of 132 in a Permutation

Authors:
Toufik Mansour;Alek Vainshtein
Affiliations:
LaBRI, Université Bordeaux 1, Talence Cedex, France, 33405f1toufik@labri.frf1;Department of Mathematics and Department of Computer Science, University of Haifa, Haifa, Israel, 31905f2alek@mathcs.haifa.ac.ilf2
Venue:
Advances in Applied Mathematics
Year:
2002

Citing 0
Cited 4

On the diagram of 132-avoiding permutations

European Journal of Combinatorics
Restricted k-ary words and functional equations

Discrete Applied Mathematics
Small configurations in simple permutations

European Journal of Combinatorics
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths

Fundamenta Informaticae - Lattice Path Combinatorics and Applications

Quantified Score

Hi-index	0.00

Visualization

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 S"2"r.