The infinite limit of separable permutations
From MaRDI portal
(Redirected from Publication:6074670)
Abstract: Let denote the uniform probability measure on the set of separable permutations in . Let with an appropriate metric and denote by the compact metric space consisting of functions from to which are injections when restricted to
m; that is, if , , then . Extending permutations by defining , for , we have . We show that converges weakly on to a limiting distribution of regenerative type, which we calculate explicitly.
Recommendations
Cites work
- A singular mathematical promenade
- Analytic combinatorics
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Expected patterns in permutation classes
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Pattern matching for permutations
- Pattern popularity in 132-avoiding permutations
- Patterns in random permutations avoiding the pattern 132
- Surprising symmetries in objects counted by Catalan numbers
- The absence of a pattern and the occurrences of another
- The Brownian limit of separable permutations
- The infinite limit of random permutations avoiding patterns of length three
Cited in
(5)- scientific article; zbMATH DE number 5037618 (Why is no real title available?)
- The permuton limit of random recursive separable permutations
- Distributions of statistics on separable permutations
- Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
This page was built for publication: The infinite limit of separable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074670)