<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T05:34:24Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/19829" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/19829</identifier><datestamp>2025-03-26T23:34:26Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Nelson, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="4de5477b-5b80-4ec5-a3c8-7a7341eb2450" confidence="600">Redlin Hume, Shayla</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-09-01T13:54:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-09-01T13:54:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-09-01</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-08-31</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/19829</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis investigates the problem of enumerating the extensions of certain matroids. A matroid M is an extension of a matroid N if M delete e is equal to N for some element e of M. Similarly, a matroid M is a coextension of a matroid N if M contract e is equal to N for some element e of M. In this thesis, we consider extensions and coextensions of matroids in the classes of graphic matroids, representable matroids, and frame matroids. We develop a general strategy for counting the extensions of matroids which translates the problem into counting stable sets in an auxiliary graph. We apply this strategy to obtain asymptotic results on the number of extensions and coextensions of certain graphic matroids, projective geometries, and Dowling geometries.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">matroid</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">extensions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">coextensions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">enumeration</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graphic matroids</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">projective geometries</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Dowling geometries</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">container method</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Enumerating matroid extensions</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Nelson, Peter</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>