Permuton limits for some permutations avoiding a single pattern
Kaitlyn Hohmeier, Erik Slivken
TL;DR
The paper addresses the problem of identifying permuton limits for random permutations drawn from pattern-avoiding classes that are in bijection with avoiding an increasing pattern of length $d+1$, proving that the limit is the anti-diagonal permuton $\mu_J$ supported on the line $x+y=1$. The authors develop a BWX-based strategy to transfer structure across related pattern-avoiding classes, analyze frozen regions created by the bijections, and apply weak-convergence lemmas to establish convergence to $\mu_J$. Key contributions include a one-sided lemma controlling mass in off-diagonal regions, a detailed structure theory for permutations in these classes, and a rigorous demonstration that uniform samples converge in distribution to $\mu_J$ (with potential extensions to related classes and the anti-diagonal limit). These results offer a concrete limiting object for a broad family of pattern-avoiding classes and illustrate a framework potentially applicable to other single-pattern families and higher-length patterns.
Abstract
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain pattern-avoiding classes that are in bijection with the class of permutations avoiding the increasing pattern of length $d+1$. In particular, we will look at a family of permutations whose permuton limit collapses to the unique permuton supported on the line $x + y = 1$ in the unit square, informally known as the anti-diagonal. We prove some general properties about permutons to aid our efforts, which may be useful for proving permuton limits that converge to the anti-diagonal for a broader range of permutation classes.
