Permutation patterns and statistics


Let Sn denote the symmetric group of all permutations of {1, 2, . . . , n} and let S = ∪n≥0Sn. If Π ⊆ S is a set of permutations, then we let Avn(Π) be the set of permutations in Sn which avoid every permutation of Π in the sense of pattern avoidance. One of the celebrated notions in pattern theory is that of Wilfequivalence, where Π and Π′ are Wilf… (More)
DOI: 10.1016/j.disc.2012.05.014

5 Figures and Tables



Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics