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...
Saved in:
Published in | The Electronic journal of combinatorics Vol. 32; no. 1 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
17.01.2025
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!