Expected Patterns in Permutation Classes

[摘要] Each length $k$ pattern occurs equally often in the set $S_n$ of all permutations of length $n$, but the same is not true in general for a proper subset of $S_n$. Miklós Bóna recently proved that if we consider the set of $n$-permutations avoiding the pat

[学科分类] 离散数学和组合数学

[关键词] permutations;patterns;dyck paths