Use this URL to cite or link to this record in EThOS:
Title: Packing and counting permutations
Author: Sliačan, Jakub
ISNI:       0000 0004 7234 0469
Awarding Body: Open University
Current Institution: Open University
Date of Award: 2018
Availability of Full Text:
Access from EThOS:
Access from Institution:
A permutation class is a set of permutations closed under taking subpermutations. We study two aspects of permutation classes: enumeration and packing. Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc and xy are permutations of lengths three and two, respectively. We represent elements from such a juxtaposition class by Dyck paths decorated with sequences of points. Context-free grammars are then used to enumerate these decorated Dyck paths. Second, we classify as algebraic the generating functions of 1×m permutation grid classes where one cell is context-free and the remaining cells are monotone. We rely on properties of combinatorial specifications of context-free classes and use operators to express juxtapositions. Repeated application of operators resolves cases for m > 2. We provide examples to re-prove known results and give new ones. Our methods are algorithmic and could be implemented on a PC. Our work on packing consolidates current knowledge about packing densities of 4-point permutations. We also improve the lower bounds for the packing densities of 1324 and 1342 and provide rigorous upper bounds for the packing densities of 1324, 1342, and 2413. All our bounds are within 10-4 of the true packing densities. Together with the known bounds, we have a fairly complete picture of 4-point packing densities. Additionally, we obtain several bounds (lower and upper) for permutations of length at least five. Our main tool for the upper bounds is the framework of flag algebras introduced by Razborov in 2007. We also present Permpack — a flag algebra package for permutations.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral