Patterns in random permutations avoiding the pattern 321

DOI10.1002/rsa.20806zbMath1423.60026arXiv1709.08427OpenAlexW2900744653WikidataQ128930751 ScholiaQ128930751MaRDI QIDQ5242876

Svante Janson

Publication date: 7 November 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random permutationspattern-avoiding permutationspatterns in permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (11)

Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ A view from the bridge spanning combinatorics and probability ⋮ Scaling limits of permutation classes with a finite specification: a dichotomy ⋮ Square permutations are typically rectangular ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Moments of permutation statistics and central limit theorems ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\) ⋮ Patterns in random permutations avoiding some sets of multiple patterns ⋮ Almost square permutations are typically square ⋮ A decorated tree approach to random permutations in substitution-closed classes ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations

This page was built for publication: Patterns in random permutations avoiding the pattern 321