{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:3288"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:3288","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Independent Sets in Some Classical Groups of Dimension Three","abstract":"Given a finite group G, an independent set S in G is a set where no element of S can be written as a word in the other elements of S. A minimax set is an independent generating set for G of largest size in G. This thesis seeks to find a good upper bound for the size of minimax sets in SL(3,q) for odd q. In preparation for this, the sizes of independent sets in SO(3,q) and SU(3,q) are also investigated for odd q. In each of the cases G = SO(3,q) or SU(3,q), q odd, it is shown that if S is an independent set in G, then either |S| has a particular upper bound, or <S> stabilises some sub-structure of the underlying vector space V. These results are then used to help gain upper bounds for minimax sets in SL(3,q). Further results are shown for finite groups which contain normal, abelian subgroups. These are then used to obtain the size of minimax sets in finite Coxeter groups of types Bn and Dn.","abstract_html":"Given a finite group G, an independent set S in G is a set where no element of S can be written as a word in the other elements of S. A minimax set is an independent generating set for G of largest size in G. This thesis seeks to find a good upper bound for the size of minimax sets in SL(3,q) for odd q. In preparation for this, the sizes of independent sets in SO(3,q) and SU(3,q) are also investigated for odd q. In each of the cases G = SO(3,q) or SU(3,q), q odd, it is shown that if S is an independent set in G, then either |S| has a particular upper bound, or &lt;S&gt; stabilises some sub-structure of the underlying vector space V. These results are then used to help gain upper bounds for minimax sets in SL(3,q). Further results are shown for finite groups which contain normal, abelian subgroups. These are then used to obtain the size of minimax sets in finite Coxeter groups of types Bn and Dn.","abstract_has_math":false,"creators":["Keen, Philip James"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-07","date_published":"2012-07","updated_at":"2026-11-19T09:27:05Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/3288/1/Decl_IS_Keen_PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A3288","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["epsrc"]},{"key":"dc:creator","label":"Author","values":["Keen, Philip James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-07"]},{"key":"dc:date.issued","label":"Date","values":["2012-07"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/3288/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/3288/1/Decl_IS_Keen_PhD.pdf","http://etheses.bham.ac.uk//id/eprint/3288/2/Keen_12_PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Given a finite group G, an independent set S in G is a set where no element of S can be written as a word in the other elements of S. A minimax set is an independent generating set for G of largest size in G. This thesis seeks to find a good upper bound for the size of minimax sets in SL(3,q) for odd q. In preparation for this, the sizes of independent sets in SO(3,q) and SU(3,q) are also investigated for odd q. In each of the cases G = SO(3,q) or SU(3,q), q odd, it is shown that if S is an independent set in G, then either |S| has a particular upper bound, or <S> stabilises some sub-structure of the underlying vector space V. These results are then used to help gain upper bounds for minimax sets in SL(3,q). Further results are shown for finite groups which contain normal, abelian subgroups. These are then used to obtain the size of minimax sets in finite Coxeter groups of types Bn and Dn."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["staffonly","public"]},{"key":"dc:title","label":"Title","values":["Independent Sets in Some Classical Groups of Dimension Three"]}]}],"canonical_facts":{"dc:contributor.sponsor":["epsrc"],"dc:creator":["Keen, Philip James"],"dc:date":["2012-07"],"dc:date.issued":["2012-07"],"dc:description.abstract":["Given a finite group G, an independent set S in G is a set where no element of S can be written as a word in the other elements of S. A minimax set is an independent generating set for G of largest size in G. This thesis seeks to find a good upper bound for the size of minimax sets in SL(3,q) for odd q. In preparation for this, the sizes of independent sets in SO(3,q) and SU(3,q) are also investigated for odd q. In each of the cases G = SO(3,q) or SU(3,q), q odd, it is shown that if S is an independent set in G, then either |S| has a particular upper bound, or <S> stabilises some sub-structure of the underlying vector space V. These results are then used to help gain upper bounds for minimax sets in SL(3,q). Further results are shown for finite groups which contain normal, abelian subgroups. These are then used to obtain the size of minimax sets in finite Coxeter groups of types Bn and Dn."],"dc:format":["application/pdf"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/3288/1/Decl_IS_Keen_PhD.pdf","http://etheses.bham.ac.uk//id/eprint/3288/2/Keen_12_PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/3288/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["staffonly","public"],"dc:title":["Independent Sets in Some Classical Groups of Dimension Three"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:27:05Z"}