<?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-22T23:43:43Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/16089" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/16089</identifier><datestamp>2025-03-26T23:35:11Z</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="5b69ce9e-6b27-47d7-b0c6-954f7cf3eb7e" confidence="600">Brown, Adam</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-07-30T19:08:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-07-30T19:08:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-07-30</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2020-07-28</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/16089</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A rank-n binary matroid is a spanning subset E of F₂ⁿ\{0}, a triangle is a set of three elements from E which sum to zero, and the density of a rank-n binary matroid is |E|/2ⁿ. We begin by giving a new exposition of a result due to Davydov and Tombak, which states that if E is a rank-n triangle-free matroid of density greater than 1/4, then there is a dimension-(n-2) subspace of F₂ⁿ which is disjoint from E. With this as a starting point, we provide a recursive structural decomposition for all maximal triangle-free binary matroids of density greater than 1/4. A key component of this decomposition is an analogous characterization of matroids which are maximal with respect to containing exactly one triangle.&#xd;
&#xd;
&#xd;
A pentagon in a binary matroid E is a set of 5 elements which sum to zero. We conjecture that if E is a rank-n triangle-free binary matroid, then E contains at most 2^{4n-16} pentagons, and provide a potential extremal example. We first resolve this conjecture when E has density at most ∜(120) /16 ≈ 0.20568. Thereafter, we use our structural decomposition to show that the conjecture holds for matroids with density greater than 1/4. This leaves the interval (∜(120)/16, 1/4], where the conjecture remains unresolved.</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">additive combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">fourier analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">coding theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">triangle-free binary matroid</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">pentagon counting</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Counting Pentagons in Triangle-free Binary Matroids</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>