The cocycle lattice of binary matroids (Q1260774)

If the weight of every cut in an edge-weighted simple graph is an integer, then the weight of every edge is an integer or a half-integer. This property \(P\) does not generalize to all binary matroids (but it does if the matroid has no parallel elements or Fano minors). The authors study the lattice (grid) generated by the incidence vectors of cocycles of a binary simple matroid, and the dual lattice. Among other results they give a polynomial algorithm to decide whether a binary matroid has the above property \(P\), and prove that every denominator in the dual lattice is a power of 2, deriving upper and lower bounds for the largest exponent.