Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4624680 | Advances in Applied Mathematics | 2015 | 20 Pages |
Abstract
We give an improved algorithm for counting the number of 1324-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical length-4 pattern-avoiding permutations, the generating function in this case does not have an algebraic singularity. Rather, the number of 1324-avoiding permutations of length n behaves asBâ
μnâ
μ1nÏâ
ng. We estimate μ=11.60±0.01, Ï=1/2, μ1=0.040±0.0015, g=â1.1±0.2 and B=7±1.3.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Andrew R. Conway, Anthony J. Guttmann,