Applying the Cluster Method to Count Occurrences of Generalized Permutation Patterns
Combinatorics
2009-06-01 v1
Abstract
We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrimsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns. Counting is done via recurrences which simplify in the case of permutations. A collection of Maple procedures implementing these recurrences accompanies the article.
Keywords
Cite
@article{arxiv.0905.4758,
title = {Applying the Cluster Method to Count Occurrences of Generalized Permutation Patterns},
author = {Andrew M. Baxter},
journal= {arXiv preprint arXiv:0905.4758},
year = {2009}
}
Comments
Maple package available for download: http://math.rutgers.edu/~baxter/ClusterGPP/index.html