Applying the cluster method to count occurrences of generalized permutation patterns

From MaRDI portal



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.





Describes a project that uses

Uses Software






This page was built for publication: Applying the cluster method to count occurrences of generalized permutation patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016321)