Abstract: We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In particular, we compute (exactly or numerically) the limit shapes with fixed hbox{12} density, with fixed hbox{12} and hbox{123} densities, with fixed hbox{12} density and the sum of hbox{123} and hbox{213} densities, and with fixed hbox{123} and hbox{321} densities. In the last case we explore a particular phase transition. To obtain our results, we also provide a description of permutons using a dynamic construction.
Recommendations
Cited in
(34)- On the cycle structure of Mallows permutations
- Limits of permutation sequences
- Independence of permutation limits at infinitely many scales
- Almost square permutations are typically square
- Density maximizers of layered permutations
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Universal limits of substitution-closed permutation classes
- Limit densities of patterns in permutation inflations
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Permutation patterns and cell decompositions
- A viewpoint for permutations with a low density of patterns
- Dense packing of patterns in a permutation
- Square permutations are typically rectangular
- Patterns in random permutations
- The runsort permuton
- Expected patterns in permutation classes
- The feasible region for consecutive patterns of permutations is a cycle polytope
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
- The number of n-queens configurations
- Baxter permuton and Liouville quantum gravity
- Existence of a symmetric bipodal phase in the edge-triangle model
- Asymptotics of discrete Schrödinger bridges via chaos decomposition
- Thresholds for patterns in random permutations with a given number of inversions
- On pattern-avoiding permutons
- The dimension of the feasible region of pattern densities (extended abstract)
- The dimension of the feasible region of pattern densities
- On the asymptotic enumeration and limit shapes of monotone grid classes of permutations
- Six-vertex model with rare corners and random restricted permutations
- Strong modeling limits of graphs with bounded tree-width
- On the sampling entropy of permutons
- A decorated tree approach to random permutations in substitution-closed classes
- Bounded affine permutations. II: Avoidance of decreasing patterns
This page was built for publication: Permutations with fixed pattern densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113938)
