Browsing Combinatorics and Optimization by Subject "additive combinatorics"
Now showing items 1-1 of 1
-
Counting Pentagons in Triangle-free Binary Matroids
(University of Waterloo, 2020-07-30)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 ...