A symplectic matroid is a collection B of k-element subsets of J = {1, 2, . . . , n, 1∗, 2∗, . . . , n∗}, each of which contains not both of i and i∗ for every i ≤ n, and which has the additional property that for any linear ordering ≺ of J such that i ≺ j implies j∗ ≺ i∗ and i ≺ j∗ implies j ≺ i∗ for all i, j ≤ n, B has a member which dominates element-wise every other member of B. Symplectic ...