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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
