The Setting
Let and be matroids on the ground set , and let be the number of their common bases, the sets that are a basis of and a basis of . Approximate counting of begins by trading the two matroids for one: a matroid on the paired ground set , whose elements come in pairs, one for each element of . The question is how a common basis of and shows up among the bases of , and what rank has.
The Claim
Definition 1. Let and be matroids whose ground sets lie in a set , and write for the disjoint union of two copies of , in which and are the copies of in the first and the second summand. The paired matroid of and is the direct sum of , placed on the first copy of , and the dual of , placed on the second: (1)✦ The slot pair of an element of is the ordered pair of its two copies, (2)✦ and the list of paired slots is the list of the slot pairs of in , in this order: (3)✦ The transversal of a subset of is the subset of (4)✦
Theorem 1. Let and be matroids whose ground sets lie in a set , the ground set of being all of , let be their paired matroid, and write for the set of bases of a matroid . For every subset of , (5)✦ If moreover is finite and and have the same rank, then the rank of is (6)✦
In the paper, the result reads: on two copies of , in which and are the copies of (the page’s and ), the matroid has rank , and is a basis of if and only if is a basis of both and .
What Is Checked
The definitions are stated over the direct sum and the dual of matroids, and the theorem over the paired matroid (1) and the transversal (4) of matroids and whose ground sets lie in , that of being all of , with finite and the two ranks equal for (6).