1324-avoiding permutations revisited

TL;DR

This paper improves an algorithm to count 1324-avoiding permutations, extends the generating function data, and provides evidence that its asymptotic behavior involves a stretched exponential term rather than a simple power law.

Contribution

An improved algorithm for counting 1324-avoiding permutations and a detailed asymptotic analysis revealing a stretched exponential growth pattern.

Findings

Generated 14 additional terms of the generating function.

Estimated growth parameters: μ=11.600, μ₁=0.0400, g=-1.1.

Provided evidence for the non-power-law nature of the generating function.

Abstract

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le 50$. We re-analyse the generating function and find additional evidence for our earlier conclusion that unlike other classical length-$4$ pattern-avoiding permutations, the generating function does not have a simple power-law singularity, but rather, the number of $1324$-avoiding permutations of length $n$ behaves as \[ B\cdot \mu^n \cdot \mu_1^{\sqrt{n}} \cdot n^g. \] We estimate $\mu=11.600 \pm 0.003$, $\mu_1 = 0.0400 \pm 0.0005$, $g = -1.1 \pm 0.1$ while the estimate of $B$ depends sensitively on the precise value of $\mu$, $\mu_1$ and $g$. This reanalysis provides substantially more compelling arguments for the presence of the stretched exponential term $\mu_1^{\sqrt{n}}$.