Use this URL to cite or link to this record in EThOS:
Title: Orderings on words and permutations
Author: McDevitt, Matthew
ISNI:       0000 0004 7972 2136
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 2019
Availability of Full Text:
Access from EThOS:
Access from Institution:
Substructure orderings are ubiquitous throughout combinatorics and all of mathematics. In this thesis we consider various orderings on words, as well as the consecutive involvement ordering on permutations. Throughout there will be a focus on deciding certain order-theoretic properties, primarily the properties of being well-quasi-ordered (WQO) and of being atomic. In Chapter 1, we establish the background material required for the remainder of the thesis. This will include concepts from order theory, formal language theory, automata theory, and the theory of permutations. We also introduce various orderings on words, and the consecutive involvement ordering on permutations. In Chapter 2, we consider the prefix, suffix and factor orderings on words. For the prefix and suffix orderings, we give a characterisation of the regular languages which are WQO, and of those which are atomic. We then consider the factor ordering and show that the atomicity is decidable for finitely-based sets. We also give a new proof that WQO is decidable for finitely-based sets, which is a special case of a result of Atminas et al. In Chapters 3 and 4, we consider some general families of orderings on words. In Chapter 3 we consider orderings on words which are rational, meaning that they can be generated by transducers. We discuss the class of insertion relations introduced in a paper by the author, and introduce a generalisation. In Chapter 4, we consider three other variations of orderings on words. Throughout these chapters we prove various decidability results. In Chapter 5, we consider the consecutive involvement on permutations. We generalise our results for the factor ordering on words to show that WQO and atomicity are decidable. Through this investigation we answer some questions which have been asked (and remain open) for the involvement on permutations.
Supervisor: Ruškuc, Nik Sponsor: Engineering and Physical Sciences Research Council (EPSRC)
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA171.48M3 ; Ordered sets ; Combinatorial analysis ; Permutations