| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777063 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
We establish a lower bound of 10.271 for the growth rate of the permutations avoiding 1324, and an upper bound of 13.5. This is done by first finding the precise growth rate of a subclass whose enumeration is related to West-2-stack-sortable permutations, and then combining copies of this subclass in particular ways.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone,