Structure of random 312-avoiding permutations
From MaRDI portal
Publication:2830242
DOI10.1002/rsa.20601zbMath1349.05006arXiv1401.6230OpenAlexW1924956554MaRDI QIDQ2830242
Publication date: 9 November 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6230
Related Items (13)
Scaling limits of permutation classes with a finite specification: a dichotomy ⋮ The Brownian limit of separable permutations ⋮ Positional strategies in games of best choice ⋮ Universal limits of substitution-closed permutation classes ⋮ Strategy-indifferent games of best choice ⋮ 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 ⋮ Avoiding patterns and making the best choice ⋮ Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations ⋮ Sorting probability of Catalan posets ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shape of random pattern-avoiding permutations
- Patterns in permutations and words.
- A variant of the tandem duplication-random loss model of genome rearrangement
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Random Walk: A Modern Introduction
- Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
- Restricted permutations
- An area-to-inv bijection between Dyck paths and 312-avoiding permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: Structure of random 312-avoiding permutations
