×
Copy the page URI to the clipboard
Bevan, David; Brignall, Robert; Price, Andrew Elvey and Pantone, Jay
(2017).
DOI: https://doi.org/10.1016/j.endm.2017.06.029
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.