Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations

We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic permuton that depends on the pattern $\alpha$ and on the parameter $\beta$. Along the way, we provide parametrizations for $\alpha$-avoiding permutons, and establish a large deviation principle for uniform $\alpha$-avoiding permutations. As a byproduct of the proof, we also obtain asymptotic estimates of two versions of $q$-Catalan numbers in the regime $q=e^{\beta/n}$.