The cocycle lattice of binary matroids. II (Q1899432): Difference between revisions

Consider the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid, and its dual lattice. In the first part of the paper (see Eur. J. Comb. 14, No. 3, 241-250 (1993; Zbl 0777.05040)) the authors have proved that every denominator in the dual lattice is a power of 2 and they have characterized those binary matroids \(M\) for which the largest exponent \(k(M)\) is 1. In this paper matroids with \(k(M) = 2\) are characterized and, for each constant \(k\), a polynomial time algorithm is given to decide whether \(k(M)\) is at least \(k\).