Independence of permutation limits at infinitely many scales

DOI10.1016/j.jcta.2021.105557zbMath1487.05007arXiv2005.11568OpenAlexW3209363207MaRDI QIDQ2062759

David I. Bevan

Publication date: 3 January 2022

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

convergencepermutationlimitpermutonpattern density

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Random measures (60G57) Convergence of probability measures (60B10)

Related Items (2)

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations

Cites Work

• Unnamed Item
• Densities in large permutations and parameter testing
• Finitely forcible graphons and permutons
• Testing permutation properties through subpermutations
• The Brownian limit of separable permutations
• 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\)
• Combinatorial specifications for juxtapositions of permutation classes
• Quasirandom permutations are characterized by 4-point densities
• Characterization of quasirandom permutations by a pattern sum
• Improving bounds on packing densities of 4-point permutations
• On the Brownian separable permuton
• Permutations with fixed pattern densities
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• The feasible region for consecutive patterns of permutations is a cycle polytope

This page was built for publication: Independence of permutation limits at infinitely many scales