Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorQuick, M. R. (Martyn R.)
dc.contributor.advisorMitchell, James David
dc.contributor.authorMcPhee, Jillian Dawn
dc.coverage.spatial162en_US
dc.date.accessioned2013-02-18T11:22:16Z
dc.date.available2013-02-18T11:22:16Z
dc.date.issued2012-11-30
dc.identifier.urihttp://hdl.handle.net/10023/3358
dc.description.abstractLet Ω be the Fraïssé limit of a class of relational structures. We seek to answer the following semigroup theoretic question about Ω. What are the group H-classes, i.e. the maximal subgroups, of End(Ω)? Fraïssé limits for which we answer this question include the random graph R, the random directed graph D, the random tournament T, the random bipartite graph B, Henson's graphs G[subscript n] (for n greater or equal to 3) and the total order Q. The maximal subgroups of End(Ω) are closely connected to the automorphism groups of the relational structures induced by the images of idempotents from End(Ω). It has been shown that the relational structure induced by the image of an idempotent from End(Ω) is algebraically closed. Accordingly, we investigate which groups can be realised as the automorphism group of an algebraically closed relational structure in order to determine the maximal subgroups of End(Ω) in each case. In particular, we show that if Γ is a countable graph and Ω = R,D,B, then there exist 2[superscript aleph-naught] maximal subgroups of End(Ω) which are isomorphic to Aut(Γ). Additionally, we provide a complete description of the subsets of Q which are the image of an idempotent from End(Q). We call these subsets retracts of Q and show that if Ω is a total order and f is an embedding of Ω into Q such that im f is a retract of Q, then there exist 2[superscript aleph-naught] maximal subgroups of End(Q) isomorphic to Aut(Ω). We also show that any countable maximal subgroup of End(Q) must be isomorphic to Zⁿ for some natural number n. As a consequence of the methods developed, we are also able to show that when Ω = R,D,B,Q there exist 2[superscript aleph-naught] regular D-classes of End(Ω) and when Ω = R,D,B there exist 2[superscript aleph-naught] J-classes of End(Ω). Additionally we show that if Ω = R,D then all regular D-classes contain 2[superscript aleph-naught] group H-classes. On the other hand, we show that when Ω = B,Q there exist regular D-classes which contain countably many group H-classes.en_US
dc.language.isoenen_US
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.subjectFraïssé limiten_US
dc.subjectRelational structureen_US
dc.subjectAlgebraically closeden_US
dc.subjectGreen's relationsen_US
dc.subjectH-classen_US
dc.subjectD-classen_US
dc.subjectJ-classen_US
dc.subjectSemigroupen_US
dc.subjectMaximal subgroupsen_US
dc.subjectRandom graphen_US
dc.subjectRandom bipartite graphen_US
dc.subjectRandom tournamenten_US
dc.subjectHenson's graphsen_US
dc.subjectRationalsen_US
dc.subjectEndomorphism semigroupen_US
dc.subjectEndomorphism monoiden_US
dc.subjectRetractsen_US
dc.subject.lccQA182.M7
dc.subject.lcshSemigroups of endomorphismsen_US
dc.subject.lcshSemigroupsen_US
dc.subject.lcshMaximal subgroupsen_US
dc.titleEndomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structuresen_US
dc.typeThesisen_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US


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