vol. 26:1, Permutation Patterns 2023

This is a special issue following the 2023 edition of the international conference on Permutation Patterns conference, which was held in Dijon, France, July 3-7, 2023.

1. A logical limit law for $231$-avoiding permutations

Michael Albert ; Mathilde Bouvel ; Valentin FĂ©ray ; Marc Noy.
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding permutation of size $n$ satisfies $\Psi$ admits a limit as $n$ is large. Moreover, we establish two further results about the behavior and value of $p_{n,\Psi}$: (i) it is either bounded away from $0$, or decays exponentially fast; (ii) the set of possible limits is dense in $[0,1]$. Our tools come mainly from analytic combinatorics and singularity analysis.
Section: Special issues

2. An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation

Anant Godbole ; Hannah Swickheimer.
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ is $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$. This exhibited the fact that random permutations pack consecutive patterns near-perfectly. We use entirely different methods, namely the Stein-Chen method of Poisson approximation, to reprove and slightly improve their result.
Section: Special issues