The Libraries will be performing routine maintenance on UWSpace on July 15th-16th, 2025. UWSpace will be available, though users may experience service lags during this time. We recommend all users avoid submitting new items to UWSpace until maintenance is completed.
 

Counting Pentagons in Triangle-free Binary Matroids

Loading...
Thumbnail Image

Date

2020-07-30

Authors

Brown, Adam

Advisor

Nelson, Peter

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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. 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.

Description

Keywords

additive combinatorics, fourier analysis, coding theory, triangle-free binary matroid, pentagon counting

LC Subject Headings

Citation