The Open UniversitySkip to content
 

On The Growth Of Permutation Classes

Bevan, David Ian (2015). On The Growth Of Permutation Classes. PhD thesis The Open University.

Full text available as:
[img]
Preview
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview
Google Scholar: Look up in Google Scholar

Abstract

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order.

First, we consider monotone grid classes of permutations. We present procedures for calculating the generating function of any class whose matrix has dimensions m × 1 for some m, and of acyclic and unicyclic classes of gridded permutations. We show that almost all large permutations in a grid class have the same shape, and determine this limit shape.

We prove that the growth rate of a grid class is given by the square of the spectral radius of an associated graph and deduce some facts relating to the set of grid class growth rates. In the process, we establish a new result concerning tours on graphs. We also prove a similar result relating the growth rate of a geometric grid class to the matching polynomial of a graph, and determine the effect of edge subdivision on the matching polynomial. We characterise the growth rates of geometric grid classes in terms of the spectral radii of trees.

We then investigate the set of growth rates of permutation classes and establish a new upper bound on the value above which every real number is the growth rate of some permutation class. In the process, we prove new results concerning expansions of real numbers in non-integer bases in which the digits are drawn from sets of allowed values.

Finally, we introduce a new enumeration technique, based on associating a graph with each permutation, and determine the generating functions for some previously unenumerated classes. We conclude by using this approach to provide an improved lower bound on the growth rate of the class of permutations avoiding the pattern 1324. In the process, we prove that, asymptotically, patterns in Łukasiewicz paths exhibit a concentrated Gaussian distribution.

Item Type: Thesis (PhD)
Copyright Holders: 2015 The Author
Keywords: permutations
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Item ID: 43875
Depositing User: David Bevan
Date Deposited: 12 Aug 2015 14:32
Last Modified: 04 Oct 2016 21:27
URI: http://oro.open.ac.uk/id/eprint/43875
Share this page:

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.

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk