Patterns in Random Permutations Avoiding the Pattern 132

DOI10.1017/S0963548316000171zbMath1381.60028arXiv1401.5679MaRDI QIDQ5366932

Svante Janson

Publication date: 10 October 2017

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

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

zbMATH Keywords

Brownian excursionrandom permutationlimit distribution

Mathematics Subject Classification ID

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

Related Items (19)

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 ⋮ The Brownian limit of separable permutations ⋮ Square permutations are typically rectangular ⋮ Unnamed Item ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ The infinite limit of separable permutations ⋮ Moments of permutation statistics and central limit theorems ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Universal limits of substitution-closed permutation classes ⋮ Fixed points of 321-avoiding permutations ⋮ On The Limiting Distributions of the Total Height On Families of Trees ⋮ 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 ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ The Infinite limit of random permutations avoiding patterns of length three ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surprising symmetries in objects counted by Catalan numbers
• The enumeration of three pattern classes using monotone grid classes
• Expected patterns in permutation classes
• 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
• Area of Catalan paths on a checkerboard
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• On \(q\)-functional equations and excursion moments
• The Brownian excursion area: A numerical analysis
• Weak convergence to Brownian meander and Brownian excursion
• Forbidden subsequences and Chebyshev polynomials
• Permutation patterns and continued fractions
• Some combinatorial properties of Schubert polynomials
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• Restricted permutations and Chebyshev polynomials
• Generating trees and forbidden subsequences
• Pattern popularity in 132-avoiding permutations
• Restricted permutations, continued fractions, and Chebyshev polynomials
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• The continuum random tree. III
• Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions
• The enumeration of permutations avoiding 2143 and 4231
• On Three Different Notions of Monotone Subsequences
• Random Trees
• The absence of a pattern and the number of occurrences of another
• The Wiener Index of simply generated random trees
• The rotation correspondence is asymptotically a dilatation
• Area and Inertial Moment of Dyck Paths
• Patterns in Random Permutations Avoiding the Pattern 132
• Probability: A Graduate Course
• Restricted permutations
• Restricted 132-avoiding permutations
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Patterns in Random Permutations Avoiding the Pattern 132