The symmetric strong circuit elimination property
Abstract
If C1 and C2 are circuits in a matroid M with e1 in C1-C2 and e in C1 C2, then M has a circuit C3 such that e∈ C3⊂eq (C1 C2)-e. This strong circuit elimination axiom is inherently asymmetric. A matroid M has the symmetric strong circuit elimination property (SSCE) if, when the above conditions hold and e2∈ C2-C1, there is a circuit C3' with \e1,e2\⊂eq C3'⊂eq (C1 C2)-e. We prove that a connected matroid has this property if and only if it has no two skew circuits. We also characterize such matroids in terms of forbidden series minors, and we give a new matroid axiom system that is built around a modification of SSCE.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.