Table of Contents
Fetching ...

Counting occurrences of patterns in permutations

Andrew R Conway, Anthony J Guttmann

Abstract

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 slightly extend some of the known results in that case, and exhaustively study the case of patterns of length 4, about which there is little previous knowledge. For such patterns, there are seven Wilf classes, and based on extensive enumerations and careful series analysis, we have conjectured the asymptotic behaviour for all classes.

Counting occurrences of patterns in permutations

Abstract

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 slightly extend some of the known results in that case, and exhaustively study the case of patterns of length 4, about which there is little previous knowledge. For such patterns, there are seven Wilf classes, and based on extensive enumerations and careful series analysis, we have conjectured the asymptotic behaviour for all classes.
Paper Structure (20 sections, 59 equations, 22 figures, 1 table)

This paper contains 20 sections, 59 equations, 22 figures, 1 table.

Figures (22)

  • Figure 1: Histogram of normalised 132 occurrences.
  • Figure 2: Histogram of normalised 123 occurrences.
  • Figure 3: Three different representations of a BDD of two variables.
  • Figure 4: Three different representations of a MBDD of two variables, similar to figure \ref{['fig:BDD_example']}.
  • Figure 5: Ratio of $\psi_1(n)/\psi_0(n)$ plotted against $1/n$ for 1234 patterns.
  • ...and 17 more figures