Scaling limits of permutation classes with a finite specification: a dichotomy
From MaRDI portal
Publication:2155196
DOI10.1016/j.aim.2022.108513OpenAlexW2922297948MaRDI QIDQ2155196
Frédérique Bassino, Lucas Gerin, Valentin Féray, Mickaël Maazoun, Adeline Pierrot, Mathilde Bouvel
Publication date: 15 July 2022
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07522
permutation patternssubstitutionanalytic combinatoricspermutation classespermutonsBrownian limiting objectsBrownian permutoncombinatorial specification of permutationsscaling limits of combinatorial structures
Related Items (6)
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ The skew Brownian permuton: A new universality class for random constrained permutations ⋮ Continuity of limit surfaces of locally uniform random permutations ⋮ Baxter permuton and Liouville quantum gravity ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Locally uniform random permutations with large increasing subsequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shape of random pattern-avoiding permutations
- Finitely forcible graphons and permutons
- An algorithm computing combinatorial specifications of permutation classes
- Enumeration of pin-permutations
- The X-class and almost-increasing permutations
- Invariance principles for spatial multitype Galton-Watson trees
- A decorated tree approach to random permutations in substitution-closed classes
- Limit theorems for triangular urn schemes
- A calculus for the random generation of labelled combinatorial structures
- The Brownian limit of separable permutations
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Limits of permutation sequences
- Universal limits of substitution-closed permutation classes
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Decomposing simple permutations, with enumerative consequences
- Simple permutations and algebraic generating functions
- Simple permutations: Decidability and unavoidable substructures
- Simple permutations and pattern restricted permutations
- Structure of random 312-avoiding permutations
- Combinatorics of Permutations
- Permutation classes
- Random Trees
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- On the Brownian separable permuton
- Patterns in random permutations avoiding the pattern 321
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- Patterns in Random Permutations Avoiding the Pattern 132
- Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
This page was built for publication: Scaling limits of permutation classes with a finite specification: a dichotomy
