Show simple item record

dc.contributor.authorDrizen, Andy L.
dc.date.accessioned2015-09-08T11:35:09Z
dc.date.available2015-09-08T11:35:09Z
dc.date.issued2012-12
dc.identifier.citationDrizen, A.L.. 2012. Generating Uniformly-Distributed Random Generalised 2-designs with Block Size 3. Queen Mary University of London.en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/8517
dc.descriptionPhDen_US
dc.description.abstractGeneralised t-designs, defined by Cameron, describe a generalisation of many combinatorial objects including: Latin squares, 1-factorisations of K2n (the complete graph on 2n vertices), and classical t-designs. This new relationship raises the question of how their respective theory would fare in a more general setting. In 1991, Jacobson and Matthews published an algorithm for generating uniformly distributed random Latin squares and Cameron conjectures that this work extends to other generalised 2-designs with block size 3. In this thesis, we divide Cameron’s conjecture into three parts. Firstly, for constants RC, RS and CS, we study a generalisation of Latin squares, which are (r c) grids whose cells each contain RC symbols from the set f1;2; : : : ; sg such that each symbol occurs RS times in each column and CS times in each row. We give fundamental theory about these objects, including an enumeration for small parameter values. Further, we prove that Cameron’s conjecture is true for these designs, for all admissible parameter values, which provides the first method for generating them uniformly at random. Secondly, we look at a generalisation of 1-factorisations of the complete graph. For constants NN and NC, these graphs have n vertices, each incident with NN coloured edges, such that each colour appears at each vertex NC times. We successfully show how to generate these designs uniformly at random when NC 0 (mod 2) and NN NC. Finally, we observe the difficulties that arise when trying to apply Jacobson and Matthews’ theory to the classical triple systems. Cameron’s conjecture remains open for these designs, however, there is mounting evidence which suggests an affirmative result. A function reference for DesignMC, the bespoke software that was used during this research, is provided in an appendix.en_US
dc.language.isoenen_US
dc.publisherQueen Mary University of Londonen_US
dc.subjectMathematicsen_US
dc.titleGenerating Uniformly-Distributed Random Generalised 2-designs with Block Size 3en_US
dc.typeThesisen_US
dc.rights.holderThe copyright of this thesis rests with the author and no quotation from it or information derived from it may be published without the prior written consent of the author


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Theses [2752]
    Theses Awarded by Queen Mary University of London

Show simple item record