Counting Occurrences of Patterns in Permutations

We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and the general behaviour of these is reasonably well-known. We s...

Full description

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 32; no. 1
Main Authors Conway, Andrew, Guttmann, Anthony
Format Journal Article
LanguageEnglish
Published 17.01.2025
Online AccessGet full text

Cover

Loading…