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.
Viewing alternatives
Download history
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 50417
- Item Type
- Conference or Workshop Item
- ISSN
- 1571-0653
- Keywords
- Permutation; patterns; enumeration; growth rate
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2017 Elsevier
- Depositing User
- Robert Brignall