The Open UniversitySkip to content
 

Staircases, dominoes, and the growth rate of 1324-avoiders

Bevan, David; Brignall, Robert; Price, Andrew Elvey and Pantone, Jay (2017). Staircases, dominoes, and the growth rate of 1324-avoiders. In: Electronic Notes in Discrete Mathematics, 61 pp. 123–129.

Full text available as:
[img]
Preview
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (110kB) | Preview
DOI (Digital Object Identifier) Link: https://doi.org/10.1016/j.endm.2017.06.029
Google Scholar: Look up in Google Scholar

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.

Item Type: Conference or Workshop Item
Copyright Holders: 2017 Elsevier
ISSN: 1571-0653
Keywords: Permutation; patterns; enumeration; growth rate
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 50417
Depositing User: Robert Brignall
Date Deposited: 08 Aug 2017 10:54
Last Modified: 15 Sep 2018 19:36
URI: http://oro.open.ac.uk/id/eprint/50417
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU