2018
DOI: 10.1002/rsa.20806
|View full text |Cite
|
Sign up to set email alerts
|

Patterns in random permutations avoiding the pattern 321

Abstract: We consider a random permutation drawn from the set of 321‐avoiding permutations of length n and show that the number of occurrences of another pattern σ has a limit distribution, after scaling by nm + ℓ where m is the length of σ and ℓ is the number of blocks in it. The limit is not normal, and can be expressed as a functional of a Brownian excursion.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 43 publications
0
11
0
Order By: Relevance
“…Let σ = 21. Then w 21 = 2 −1/2 , see [13], and thus (3.5)-(3.6), with ℓ = 1 and m 1 = m = 2, yield for the number of inversions,…”
Section: Avoiding a Single Permutation Of Lengthmentioning
confidence: 93%
See 3 more Smart Citations
“…Let σ = 21. Then w 21 = 2 −1/2 , see [13], and thus (3.5)-(3.6), with ℓ = 1 and m 1 = m = 2, yield for the number of inversions,…”
Section: Avoiding a Single Permutation Of Lengthmentioning
confidence: 93%
“…There are 6 cases where a single permutation of length 3 is avoided, but by the symmetries in Subsection 2.2 these reduce to 2 non-equivalent cases, for example 132 (equivalent to 231, 213, 312) and 321 (equivalent to 123). These cases are treated in detail in [12] and [13], respectively. Both analyses are based on bijections with binary trees and Dyck paths, and the well-known convergence in distribution of random Dyck paths to a Brownian excursion, but the details are very different, and so are in general the resulting limit distributions.…”
Section: Avoiding a Single Permutation Of Lengthmentioning
confidence: 99%
See 2 more Smart Citations
“…The recent works of Gaetz and Ryba [30] and Kammoun [38] establish normal limit laws on certain classes of permutations for classical and vincular patterns, respectively. In addition, Janson [35,36] showed that the number of pattern occurrences is not normally distributed when we sample from the permutations avoiding a certain fixed pattern. Earlier, Janson, Nakamura and Zeilberger [37] initiated the study of the same general question.…”
Section: Introductionmentioning
confidence: 99%