Determining a binary matroid from its small circuits (Q2635090)

Summary: It is well known that a rank-\(r\) matroid \(M\) is uniquely determined by its circuits of size at most \(r\). This paper proves that if \(M\) is binary and \(r\geqslant 3\), then \(M\) is uniquely determined by its circuits of size at most \(r-1\) unless \(M\) is a binary spike or a special restriction thereof. In the exceptional cases, \(M\) is determined up to isomorphism.