Patterns in random permutations avoiding the pattern 132

DOI10.1017/S0963548316000171zbMATH Open1381.60028arXiv1401.5679MaRDI QIDQ5366932FDOQ5366932

Authors: Svante Janson 

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $sigma$ has a limit distribution, after scaling by $n^{lambda(sigma)/2}$ where $lambda(sigma)$ is the length of $sigma$ plus the number of descents. The limit is not normal, and can be expressed as a functional of a Brownian excursion. Moments can be found by recursion.

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

Recommendations

• Patterns in random permutations avoiding the pattern 321
• Patterns in random permutations avoiding some other patterns
• Patterns in random permutations avoiding some sets of multiple patterns
• Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
• The shape of random pattern-avoiding permutations

zbMATH Keywords

limit distributionrandom permutationBrownian excursion

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analytic combinatorics
• Random Trees
• Title not available (Why is that?)
• Restricted permutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• The rotation correspondence is asymptotically a dilatation
• Probability: a graduate course
• Permutations with restricted patterns and Dyck paths
• Some combinatorial properties of Schubert polynomials
• Restricted permutations and Chebyshev polynomials
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• Weak convergence to Brownian meander and Brownian excursion
• The continuum random tree. III
• Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excur\-sions
• The Brownian excursion area: A numerical analysis
• Title not available (Why is that?)
• Generating trees and forbidden subsequences
• Area of Catalan paths on a checkerboard
• Surprising symmetries in objects counted by Catalan numbers
• Expected patterns in permutation classes
• Restricted 132-avoiding permutations
• Pattern popularity in 132-avoiding permutations
• The absence of a pattern and the occurrences of another
• The Wiener Index of simply generated random trees
• Restricted permutations, continued fractions, and Chebyshev polynomials
• The enumeration of three pattern classes using monotone grid classes
• The enumeration of permutations avoiding 2143 and 4231
• Forbidden subsequences and Chebyshev polynomials
• Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
• The density of the ISE and local limit laws for embedded trees
• Permutation patterns and continued fractions
• Patterns in random permutations avoiding the pattern 132
• Area and Inertial Moment of Dyck Paths
• On \(q\)-functional equations and excursion moments
• On three different notions of monotone subsequences
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns

Cited In (28)

• Bounded affine permutations. II: Avoidance of decreasing patterns
• A view from the bridge spanning combinatorics and probability
• Arcsine laws for random walks generated from random permutations with applications to genomics
• The shape of random pattern-avoiding permutations
• Pattern-avoiding permutations and Brownian excursion. II: Fixed points
• Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
• Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
• Moments of permutation statistics and central limit theorems
• The Brownian limit of separable permutations
• Patterns in random permutations avoiding the pattern 132
• Universal limits of substitution-closed permutation classes
• Structure of random \(312\)-avoiding permutations
• Square permutations are typically rectangular
• Scaling limits of permutation classes with a finite specification: a dichotomy
• Fixed points of 321-avoiding permutations
• On the limiting distributions of the total height on families of trees
• The location of the first ascent in a 123-avoiding permutation
• Patterns in random permutations avoiding the pattern 321
• On avoiding 1233
• The infinite limit of separable permutations
• Permutations avoiding 1324 and patterns in Łukasiewicz paths
• The feasible regions for consecutive patterns of pattern-avoiding permutations
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
• Patterns in random permutations avoiding some other patterns
• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
• Impulse parameter and a new equivalence between 123- and 132-avoiding permutations
• Patterns in random permutations avoiding some sets of multiple patterns
• The infinite limit of random permutations avoiding patterns of length three

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366932)