Universal limits of substitution-closed permutation classes

DOI10.4171/JEMS/993zbMath1469.60039arXiv1706.08333OpenAlexW2686806474MaRDI QIDQ2216743

Frédérique Bassino, Adeline Pierrot, Mickaël Maazoun, Mathilde Bouvel, Valentin Féray, Lucas Gerin

Publication date: 17 December 2020

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.08333

zbMATH Keywords

permutation patternssimple permutationspermutons

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (20)

Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable 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 ⋮ The runsort permuton ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Random cographs: Brownian graphon limit and asymptotic degree distribution ⋮ The skew Brownian permuton: A new universality class for random constrained permutations ⋮ Baxter permuton and Liouville quantum gravity ⋮ The number of occurrences of patterns in a random tree or forest permutation ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\) ⋮ Patterns in random permutations avoiding some sets of multiple patterns ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ Independence of permutation limits at infinitely many scales ⋮ On the Brownian separable permuton ⋮ Almost square permutations are typically square ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations ⋮ The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation in exponential families on permutations
• Fixed points and cycle structure of random permutations
• Densities in large permutations and parameter testing
• The shape of random pattern-avoiding permutations
• Surprising symmetries in objects counted by Catalan numbers
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• The enumeration of three pattern classes using monotone grid classes
• Expected patterns in permutation classes
• Finitely forcible graphons and permutons
• Enumeration of pin-permutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Substitution-closed pattern classes
• Pattern-avoiding permutations and Brownian excursion. II: Fixed points
• Area of Catalan paths on a checkerboard
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• The Brownian limit of separable permutations
• Limits of permutation sequences
• Pattern popularity in 132-avoiding permutations
• Generating and enumerating 321-avoiding and skew-merged simple permutations
• Some families of trees arising in permutation analysis
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Geometry of permutation limits
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• The enumeration of permutations avoiding 3124 and 4312
• The continuum random tree. III
• Counting 1324, 4231-avoiding permutations
• Longest monotone subsequences and rare regions of pattern-avoiding permutations
• Enumerating indices of Schubert varieties defined by inclusions
• Simple permutations: Decidability and unavoidable substructures
• Simple permutations and pattern restricted permutations
• Structure of random 312-avoiding permutations
• Inflations of Geometric Grid Classes: Three Case Studies
• The enumeration of permutations avoiding 2143 and 4231
• Schröder’s problems and scaling limits of random trees
• A Survey of Simple Permutations
• Random Trees
• The absence of a pattern and the number of occurrences of another
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• On the Brownian separable permuton
• Permutations with fixed pattern densities
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• Patterns in Random Permutations Avoiding the Pattern 132
• Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
• The Expected Shape of Random Doubly Alternating Baxter Permutations
• Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations

This page was built for publication: Universal limits of substitution-closed permutation classes