Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
Mathematics & Statistics (School of) >
Pure Mathematics >
Pure Mathematics Theses >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/237
This item has been viewed 20 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Stephen Waton Thesis.pdf1.22 MBAdobe PDFView/Open
Title: On permutation classes defined by token passing networks, gridding matrices and pictures : three flavours of involvement
Authors: Waton, Stephen D.
Supervisors: Ruškuc, Nik
Keywords: Combinatorics
Finite mathematics
Issue Date: 19-Jun-2007
Abstract: The 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.
URI: http://hdl.handle.net/10023/237
Type: Thesis
Publisher: University of St Andrews
Appears in Collections:Pure Mathematics Theses



This item is protected by original copyright

This item is licensed under a Creative Commons License
Creative Commons

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)