Expected patterns in permutation classes

zbMath1253.05009arXiv1206.0320MaRDI QIDQ456387

Cheyne Homberger

Publication date: 24 October 2012

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

Full work available at URL: https://arxiv.org/abs/1206.0320

zbMATH Keywords

permutationsDyck pathspatterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (13)

The Brownian limit of separable permutations ⋮ The equidistribution of some length-three vincular patterns on \(S_n(132)\) ⋮ The shape of random pattern-avoiding permutations ⋮ The infinite limit of separable permutations ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ Unnamed Item ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Universal limits of substitution-closed permutation classes ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ Pattern statistics in faro words and permutations ⋮ Popularity of patterns over \(d\)-equivalence classes of words and permutations ⋮ Counting pattern avoiding permutations by number of movable letters ⋮ Equipopularity classes in the separable permutations

This page was built for publication: Expected patterns in permutation classes