Pattern popularity in 132-avoiding permutations

zbMath1267.05013MaRDI QIDQ1953384

Kate Rudolph

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p8

zbMATH Keywords

permutationspattern-avoidanceequipopular patternsequipopularity relationspattern popularity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (10)

The Brownian limit of separable permutations ⋮ The infinite limit of separable permutations ⋮ Equipopularity classes of 132-avoiding permutations ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Universal limits of substitution-closed permutation classes ⋮ The pure descent statistic on permutations ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ Popularity of patterns over \(d\)-equivalence classes of words and permutations ⋮ Equipopularity classes in the separable permutations

This page was built for publication: Pattern popularity in 132-avoiding permutations