Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorRuškuc, Nik
dc.contributor.authorWaton, Stephen D.
dc.coverage.spatial197en
dc.date.accessioned2007-03-26T09:11:54Z
dc.date.available2007-03-26T09:11:54Z
dc.date.issued2007-06-19
dc.identifier.urihttp://hdl.handle.net/10023/237
dc.description.abstractThe study of pattern classes is the study of the involvement order on finite permutations. This order can be traced back to the work of Knuth. In recent years the area has attracted the attention of many combinatoralists and there have been many structural and enumerative developments. We consider permutations classes defined in three different ways and demonstrate that asking the same fixed questions in each case motivates a different view of involvement. Token passing networks encourage us to consider permutations as sequences of integers; grid classes encourage us to consider them as point sets; picture classes, which are developed for the first time in this thesis, encourage a purely geometrical approach. As we journey through each area we present several new results. We begin by studying the basic definitions of a permutation. This is followed by a discussion of the questions one would wish to ask of permutation classes. We concentrate on four particular areas: partial well order, finite basis, atomicity and enumeration. Our third chapter asks these questions of token passing networks; we also develop the concept of completeness and show that it is decidable whether or not a particular network is complete. Next we move onto grid classes, our analysis using generic sets yields an algorithm for determining when a grid class is atomic; we also present a new and elegant proof which demonstrates that certain grid classes are partially well ordered. The final chapter comprises the development and analysis of picture classes. We completely classify and enumerate those permutations which can be drawn from a circle, those which can be drawn from an X and those which can be drawn from some convex polygon. We exhibit the first uncountable set of closed classes to be found in a natural setting; each class is drawn from three parallel lines. We present a permutation version of the famous `happy ending' problem of Erdös and Szekeres. We conclude with a discussion of permutation classes in higher dimensional space.en
dc.format.extent1248459 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherUniversity of St Andrews
dc.rightsCreative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/
dc.subjectCombinatoricsen
dc.subjectFinite mathematicsen
dc.subject.lccQA165.W2
dc.subject.lcshPermutationsen
dc.titleOn permutation classes defined by token passing networks, gridding matrices and pictures : three flavours of involvementen
dc.typeThesisen
dc.contributor.sponsorEngineering and Physical Sciences Research Council (EPSRC)en
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhD Doctor of Philosophyen
dc.publisher.institutionThe University of St Andrewsen


The following license files are associated with this item:

  • Creative Commons

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Except where otherwise noted within the work, this item's license for re-use is described as Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported