Scaling limits of permutation classes with a finite specification: a dichotomy
DOI10.1016/J.AIM.2022.108513OpenAlexW2922297948MaRDI QIDQ2155196FDOQ2155196
Frédérique Bassino, L. 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
Recommendations
substitutionpermutation patternsanalytic combinatoricspermutation classespermutonsBrownian limiting objectsBrownian permutoncombinatorial specification of permutationsscaling limits of combinatorial structures
Cites Work
- Limits of permutation sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Title not available (Why is that?)
- Random Trees
- Combinatorics of permutations
- Invariance principles for spatial multitype Galton-Watson trees
- Limit theorems for triangular urn schemes
- Permutation classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finitely forcible graphons and permutons
- The X-class and almost-increasing permutations
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- A calculus for the random generation of labelled combinatorial structures
- Simple permutations: Decidability and unavoidable substructures
- Simple permutations and pattern restricted permutations
- The shape of random pattern-avoiding permutations
- Simple permutations and algebraic generating functions
- Structure of random \(312\)-avoiding permutations
- Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
- The Brownian limit of separable permutations
- An algorithm computing combinatorial specifications of permutation classes
- Enumeration of pin-permutations
- Decomposing simple permutations, with enumerative consequences
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- On the Brownian separable permuton
- Patterns in random permutations avoiding the pattern 321
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- A decorated tree approach to random permutations in substitution-closed classes
- Universal limits of substitution-closed permutation classes
- Patterns in Random Permutations Avoiding the Pattern 132
Cited In (13)
- Continuity of limit surfaces of locally uniform random permutations
- Limit densities of patterns in permutation inflations
- Baxter permuton and Liouville quantum gravity
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Universal limits of substitution-closed permutation classes
- A logical limit law for \(231\)-avoiding permutations
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
- The skew Brownian permuton: A new universality class for random constrained permutations
- Locally uniform random permutations with large increasing subsequences
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons
- Title not available (Why is that?)
This page was built for publication: Scaling limits of permutation classes with a finite specification: a dichotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155196)