Counting occurences of 132 in a permutation
classification
🧮 math.CO
keywords
functionoccurencespermutationsamountscheckcontainingcountingexactly
read the original abstract
We study the generating function for the number of permutations on n letters containing exactly $r\gs0$ occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.