Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
From MaRDI portal
Publication:5739096
DOI10.1002/rsa.20677zbMath1364.05003arXiv1406.5156OpenAlexW604583610WikidataQ115150361 ScholiaQ115150361MaRDI QIDQ5739096
Douglas Rizzolo, Erik Slivken, Christopher Hoffmann
Publication date: 2 June 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.5156
Related Items (19)
Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes ⋮ 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 ⋮ The runsort permuton ⋮ Universal limits of substitution-closed permutation classes ⋮ Large deviations for permutations avoiding monotone patterns ⋮ Fixed points of 321-avoiding permutations ⋮ Pattern-avoiding permutations and Brownian excursion. II: Fixed points ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ Sorting probability of Catalan posets ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\) ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ The Infinite limit of random permutations avoiding patterns of length three ⋮ Almost square permutations are typically square ⋮ A decorated tree approach to random permutations in substitution-closed classes ⋮ Exchangeable interval hypergraphs and limits of ordered discrete structures ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics
Cites Work
- Unnamed Item
- The shape of random pattern-avoiding permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Bijections for refined restricted permutations
- Fixed points and excedances in restricted permutations
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Symmetric functions and P-recursiveness
- A variant of the tandem duplication-random loss model of genome rearrangement
- Conditional limit theorems for branching processes
- An invariance principle for random walk conditioned by a late return to zero
- Some combinatorial properties of Schubert polynomials
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- Generalized permutation patterns and a classification of the Mahonian statistics
- Asymptotic theory of characters of the symmetric group
- Longest increasing subsequences in pattern-restricted permutations
- Multiple pattern avoidance with respect to fixed points and excedances
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Tableaux combinatorics for the asymmetric exclusion process
- Structure of random 312-avoiding permutations
- Schröder’s problems and scaling limits of random trees
- On the distribution of the length of the longest increasing subsequence of random permutations
- Sorting Using Networks of Queues and Stacks
- Brownian Motion
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
