Symmetric Strong Circuit Elimination (SSCE)

• SSCE is a strengthened version of the traditional strong circuit elimination axiom, requiring the simultaneous preservation of noncommon elements from intersecting circuits.
• It characterizes connected matroids by excluding skew circuits and forbidden series minors, thereby linking the property to dual unbreakability.
• A modified symmetric elimination axiom provides a complete circuit cryptomorphism, highlighting essential interactions that underpin structural connectivity in matroid theory.

Searching arXiv for the specified papers and topic. arXiv search query: (Delucchi, 2010) OR (Cho et al., 31 Jul 2025) SSCE matroid circuit elimination The Symmetric Strong Circuit Elimination Property (SSCE) is a strengthening of the usual strong circuit elimination axiom in matroid theory. In its standard asymmetric form, strong circuit elimination asserts that if $C_1$ and $C_2$ are circuits, $e\in C_1\cap C_2$, and $e_1\in C_1-C_2$, then there is a circuit $C_3$ such that $e_1\in C_3\subseteq (C_1\cup C_2)-e$. SSCE replaces this one-sided preservation requirement with a symmetric one: whenever $e_1\in C_1-C_2$, $e_2\in C_2-C_1$, and $e\in C_1\cap C_2$, there must exist a circuit $C_3'$ with $C_2$0 (Cho et al., 31 Jul 2025). The property is not universal for matroids; rather, it characterizes a special class of connected matroids, and its study has led to both a structural classification and a modified circuit axiom system. A related but distinct development shows that, in both matroids and oriented matroids, elimination need only be imposed on modular pairs of circuits to recover the full theory (Delucchi, 2010).

1. Definition and relation to strong circuit elimination

The standard strong circuit elimination property recalled in the literature takes the following form: if $C_2$1 and $C_2$2 are circuits in a matroid $C_2$3, with

$C_2$4

then $C_2$5 has a circuit $C_2$6 such that

$C_2$7

This form is inherently asymmetric because it protects only a chosen element from $C_2$8 (Cho et al., 31 Jul 2025).

SSCE is defined by strengthening the conclusion symmetrically. A matroid $C_2$9 has the symmetric strong circuit elimination property if, whenever $e\in C_1\cap C_2$0 and $e\in C_1\cap C_2$1 are circuits and

$e\in C_1\cap C_2$2

there is a circuit $e\in C_1\cap C_2$3 such that

$e\in C_1\cap C_2$4

(Cho et al., 31 Jul 2025).

The distinction is substantive rather than terminological. Ordinary strong elimination guarantees preservation of one designated element from one side of the overlap; SSCE requires simultaneous preservation of one designated element from each side. This makes SSCE strictly stronger than ordinary strong elimination. The difference is not formal only: there exist matroids in which ordinary elimination holds, as it must, but SSCE fails (Cho et al., 31 Jul 2025).

2. Structural characterization in connected matroids

For connected matroids, SSCE admits an exact structural characterization. The central theorem states that for a connected matroid $e\in C_1\cap C_2$5, the following are equivalent:

1. $e\in C_1\cap C_2$6 has the symmetric strong circuit elimination property;
2. $e\in C_1\cap C_2$7 has no pair of skew circuits;
3. for all integers $e\in C_1\cap C_2$8 and $e\in C_1\cap C_2$9 exceeding two, $e_1\in C_1-C_2$0 has no series minor isomorphic to

$e_1\in C_1-C_2$1

1. $e_1\in C_1-C_2$2 is unbreakable (Cho et al., 31 Jul 2025).

This theorem identifies the precise obstruction to SSCE: the presence of two skew circuits. Sets $e_1\in C_1-C_2$3 and $e_1\in C_1-C_2$4 in a matroid are skew if

$e_1\in C_1-C_2$5

For circuits $e_1\in C_1-C_2$6 and $e_1\in C_1-C_2$7, this means that on their union the matroid restricts as a direct sum of the two circuit restrictions. The paper gives the explicit formulation that a matroid has $e_1\in C_1-C_2$8 skew circuits if it has circuits $e_1\in C_1-C_2$9 such that

$C_3$0

(Cho et al., 31 Jul 2025).

The equivalence with unbreakability of the dual places SSCE within an established connectivity framework. The relevant notion is that a matroid $C_3$1 is unbreakable if $C_3$2 is connected and $C_3$3 is connected for every flat $C_3$4 of $C_3$5 (Cho et al., 31 Jul 2025). Combined with the cited result of Oxley–Pfeil, this yields

$C_3$6

for connected $C_3$7 (Cho et al., 31 Jul 2025).

3. Skew circuits as the obstruction

The equivalence between SSCE and the absence of skew circuits is the conceptual core of the theory. If SSCE fails, then there are circuits $C_3$8 and elements

$C_3$9

such that no circuit $e_1\in C_3\subseteq (C_1\cup C_2)-e$0 satisfies

$e_1\in C_3\subseteq (C_1\cup C_2)-e$1

Ordinary strong elimination can still be applied separately to obtain circuits $e_1\in C_3\subseteq (C_1\cup C_2)-e$2 with

$e_1\in C_3\subseteq (C_1\cup C_2)-e$3

If $e_1\in C_3\subseteq (C_1\cup C_2)-e$4 and $e_1\in C_3\subseteq (C_1\cup C_2)-e$5 are not skew, then $e_1\in C_3\subseteq (C_1\cup C_2)-e$6 is connected, so there is a circuit $e_1\in C_3\subseteq (C_1\cup C_2)-e$7 containing $e_1\in C_3\subseteq (C_1\cup C_2)-e$8, contradicting the assumed failure. Therefore failure of SSCE forces the one-sided elimination circuits to form a skew pair (Cho et al., 31 Jul 2025).

This explains why skewness is exactly the missing condition needed to upgrade ordinary strong elimination to symmetric strong elimination. Ordinary strong elimination only requires enough internal interaction to preserve one chosen element. SSCE requires enough interaction between both noncommon parts of the original circuits to preserve one chosen element from each side after eliminating a shared element. When two circuits are skew, that coupling is absent: they behave rank-theoretically like separate summands on their union (Cho et al., 31 Jul 2025).

A plausible implication is that SSCE should be regarded less as an alternative axiom for arbitrary matroids than as a circuit-theoretic regularity condition detecting a strong form of internal connectivity among intersecting circuits.

4. Forbidden series minors and examples

The forbidden series-minor characterization in the connected case is given by the infinite family

$e_1\in C_3\subseteq (C_1\cup C_2)-e$9

(Cho et al., 31 Jul 2025). Here $e_1\in C_1-C_2$0 denotes a series connection. The class of matroids satisfying SSCE is closed under series minors, meaning minors obtained by deletions and series contractions (Cho et al., 31 Jul 2025).

The basic counterexample is $e_1\in C_1-C_2$1, described as the series connection of two copies of $e_1\in C_1-C_2$2: $e_1\in C_1-C_2$3 It is obtained from a $e_1\in C_1-C_2$4-circuit $e_1\in C_1-C_2$5 by adding $e_1\in C_1-C_2$6 in parallel to $e_1\in C_1-C_2$7 for $e_1\in C_1-C_2$8. Taking

$e_1\in C_1-C_2$9

one has

$e_2\in C_2-C_1$0

but there is no circuit contained in

$e_2\in C_2-C_1$1

that contains $e_2\in C_2-C_1$2. Thus $e_2\in C_2-C_1$3 fails SSCE (Cho et al., 31 Jul 2025). The same example exhibits the obstruction explicitly: $e_2\in C_2-C_1$4 and $e_2\in C_2-C_1$5 are skew circuits (Cho et al., 31 Jul 2025).

The class is not minor-closed under arbitrary contraction. The paper notes that $e_2\in C_2-C_1$6 has no pair of skew circuits and hence satisfies SSCE, but every single-element contraction of $e_2\in C_2-C_1$7 is isomorphic to $e_2\in C_2-C_1$8, so SSCE fails to be preserved under general contraction (Cho et al., 31 Jul 2025). This distinction between series-minor closure and minor closure is a central technical limitation of the property.

In the binary setting, the paper also proves that a connected binary matroid with three skew circuits has a series minor isomorphic to $e_2\in C_2-C_1$9, where $e\in C_1\cap C_2$0 is one of the graphs $e\in C_1\cap C_2$1 in Figure 1 (Cho et al., 31 Jul 2025). This is presented as a related structural theorem about skew circuits rather than a direct reformulation of SSCE.

5. Modified symmetric elimination as a matroid axiom

Although SSCE itself is not valid in all matroids, a closely related symmetric elimination principle does yield a universal axiom system. Let $e\in C_1\cap C_2$2 be the set of circuits of a matroid $e\in C_1\cap C_2$3. The paper proves that $e\in C_1\cap C_2$4 obeys the following condition:

(C3)$e\in C_1\cap C_2$5 Let $e\in C_1\cap C_2$6 and $e\in C_1\cap C_2$7 be members of $e\in C_1\cap C_2$8 with $e\in C_1\cap C_2$9 If $C_3'$0 and $C_3'$1 contains no member of $C_3'$2, then $C_3'$3 contains a member $C_3'$4 such that $C_3'$5 Furthermore, $C_3'$6 is the unique circuit of $C_3'$7 contained in $C_3'$8 (Cho et al., 31 Jul 2025).

The added hypothesis is that

$C_3'$9

contains no circuit; equivalently, that union is independent in the stated sense (Cho et al., 31 Jul 2025). This condition repairs the failure of naive SSCE and makes the symmetric conclusion universally valid.

The resulting cryptomorphism is that a collection $C_2$00 of nonempty pairwise incomparable subsets of a finite set $C_2$01 is the set of circuits of a matroid on $C_2$02 if and only if $C_2$03 satisfies (C3)$C_2$04 (Cho et al., 31 Jul 2025). Thus the usual circuit axioms can be replaced by nonemptiness, pairwise incomparability, and this modified symmetric elimination condition.

The paper also records an essential limitation: one cannot weaken $C_2$05 by merely asking $C_2$06 and $C_2$07, rather than requiring

$C_2$08

A counterexample comes from the cycle matroid of $C_2$09 (Cho et al., 31 Jul 2025). This shows that the asymmetry in where the designated elements are drawn from remains structurally important even in the repaired symmetric axiom.

6. Relation to modular elimination and oriented matroids

A distinct line of work shows that elimination axioms can often be imposed only on modular pairs of circuits without loss of generality. For a family $C_2$10 of incomparable subsets, one forms

$C_2$11

ordered by inclusion. Two members of $C_2$12 are a modular pair if they are a modular pair in the atomic lattice $C_2$13; equivalently, their join has lower interval of length $C_2$14 (Delucchi, 2010).

In the matroid setting, if $C_2$15 is a collection of incomparable finite subsets of a set $C_2$16, the paper defines the elimination property

$C_2$17

Its main theorem states:

Let $C_2$18 be a collection of incomparable finite subsets of a set $C_2$19. If $C_2$20 for all modular pairs $C_2$21, then $C_2$22 for all pairs $C_2$23 (Delucchi, 2010).

For finite $C_2$24, this yields a circuit characterization of matroids using elimination only on modular pairs (Delucchi, 2010). The significance for SSCE is indirect but substantial. SSCE is a strengthening of circuit elimination, while modular-elimination theory shows that, in ordinary matroid axiomatization, one can drastically reduce the set of circuit pairs on which elimination must be checked.

The oriented-matroid analogue uses signed circuits $C_2$25, support

$C_2$26

$C_2$27-symmetry under $C_2$28, and the strong oriented elimination axiom

$C_2$29

The paper proves that it is enough to require $C_2$30 only when $C_2$31 and $C_2$32 form a modular pair (Delucchi, 2010).

The term “Symmetric Strong Circuit Elimination Property” does not appear there, but the comparison is informative. In oriented matroids, the elimination statement just displayed is already symmetric under swapping $C_2$33 and $C_2$34 in the evident sense, whereas the 2025 work isolates a genuinely stronger symmetric requirement in the unoriented matroid setting: simultaneous preservation of distinguished elements from both sides of a circuit overlap [(Delucchi, 2010); (Cho et al., 31 Jul 2025)]. This suggests that “symmetry” has different technical roles in the two contexts—coordinatewise symmetry in oriented elimination versus bilateral preservation in SSCE.

7. Significance and scope

SSCE occupies an intermediate position between standard circuit axioms and specialized structural properties. It is not a cryptomorphic axiom for all matroids, because it fails in examples such as $C_2$35 (Cho et al., 31 Jul 2025). At the same time, it is not merely a curiosity: in connected matroids it admits a complete structural description in terms of skew circuits, forbidden series minors, and dual unbreakability (Cho et al., 31 Jul 2025).

Its main significance lies in clarifying what additional circuit interaction is required beyond ordinary strong elimination. The characterization

$C_2$36

for connected matroids gives a precise answer (Cho et al., 31 Jul 2025).

A second contribution is methodological. The modified symmetric elimination axiom $C_2$37 shows that the failure of naive SSCE can be repaired by inserting the right independence hypothesis, yielding a full circuit cryptomorphism (Cho et al., 31 Jul 2025). In parallel, modular-elimination theory shows that elimination conditions may often be localized to modular pairs without changing the resulting theory (Delucchi, 2010).

Taken together, these developments place SSCE within a broader program in matroid theory: refining elimination principles to identify which local circuit interactions are genuinely essential, which are redundant, and which capture special structural classes rather than the entire category of matroids [(Delucchi, 2010); (Cho et al., 31 Jul 2025)].