Matroid Isomorphism Games

• Matroid isomorphism games are game-theoretic frameworks that compare cryptomorphic matroid structures using synchronous nonlocal strategies.
• They utilize relation-colored graphs and pointed subsets to reconstruct isomorphisms through perfect classical winning strategies.
• They extend to quantum settings, defining S-quantum isomorphism via operator-algebraic methods that capture noncommutative symmetries.

Searching arXiv for the cited papers to ground the article in current arXiv records. Search results for ([2507.06225](/papers/2507.06225))

Matroid isomorphism games are game-theoretic procedures for comparing matroids through structural data such as bases, circuits, flats, hyperplanes, or pointed versions of these families. In the finite setting, a recent formulation defines a collection of synchronous two-player nonlocal games, one for each covering matroid isomorphism structure $S$, with the property that two matroids are isomorphic if and only if the corresponding game has a perfect classical winning strategy; allowing perfect quantum commuting strategies yields a weaker notion of $S$-quantum isomorphism, and this relaxation is strict (Corey et al., 8 Jul 2025). Earlier work supplies several antecedents and concrete arenas for such games: graphic truncations and adjacency-based binary matroids in which matroid isomorphism collapses to graph isomorphism on specific classes, circuit–cocircuit games for infinite matroids tied to determinacy, and move-based comparison procedures for signed-graph representations of even cycle matroids (Jesus et al., 2022, Traldi, 2020, Bowler et al., 2013, Guenin et al., 2011).

1. Axiomatic basis and isomorphism structures

The 2025 framework starts from the basis axiomatization of a finite matroid $M=(E(M),B(M))$, where $B(M)\subseteq \binom{E(M)}{r}$ is a nonempty collection of $r$-element subsets satisfying the basis exchange axiom. From this one obtains the standard cryptomorphic data: independent sets $I(M)$, circuits $C(M)$, rank function $\operatorname{rk}_M$, closure $\operatorname{cl}_M$, flats $F(M)$, and hyperplanes $S$0 (Corey et al., 8 Jul 2025).

A central abstraction is the notion of a matroid isomorphism structure. This is a function

$S$1

such that $S$2 for each matroid $S$3, and a bijection $S$4 is a matroid isomorphism if and only if

$S$5

Examples include $S$6, $S$7 (nonbases), $S$8, $S$9, $M=(E(M),B(M))$0, and $M=(E(M),B(M))$1 (Corey et al., 8 Jul 2025).

The game construction requires a covering condition. The structure $M=(E(M),B(M))$2 covers $M=(E(M),B(M))$3 if every $M=(E(M),B(M))$4 lies in some $M=(E(M),B(M))$5. The paper gives precise coverage criteria for standard cryptomorphisms: $M=(E(M),B(M))$6 covers $M=(E(M),B(M))$7 iff $M=(E(M),B(M))$8 has no loops, $M=(E(M),B(M))$9 covers $B(M)\subseteq \binom{E(M)}{r}$0 iff $B(M)\subseteq \binom{E(M)}{r}$1 has no coloops, and flats and hyperplanes always cover (Corey et al., 8 Jul 2025). This condition allows the game to recover element-level information from higher-order subsets.

2. Pointed subsets, relation-colored graphs, and the nonlocal game

For a covering structure $B(M)\subseteq \binom{E(M)}{r}$2, the basic question and answer objects are pointed $B(M)\subseteq \binom{E(M)}{r}$3-subsets,

$B(M)\subseteq \binom{E(M)}{r}$4

For $B(M)\subseteq \binom{E(M)}{r}$5, the notation $B(M)\subseteq \binom{E(M)}{r}$6 and $B(M)\subseteq \binom{E(M)}{r}$7 is used. A four-valued relation

$B(M)\subseteq \binom{E(M)}{r}$8

records whether two pointed subsets have the same underlying set and whether they have the same distinguished point: $B(M)\subseteq \binom{E(M)}{r}$9 This produces a relation-colored graph $r$0 with vertex set $r$1 (Corey et al., 8 Jul 2025).

The matroid isomorphism game associated to $r$2 is then a synchronous nonlocal game with

$r$3

In each round the referee sends pointed subsets $r$4 to the two players, and the players answer with $r$5. They win if two conditions hold. First, each answer must lie in the opposite matroid from the corresponding question. Second, relation colors must be preserved across the two sides: if $r$6 with $r$7, $r$8, and similarly $r$9, then

$I(M)$0

The resulting game is bisynchronous, and it is exactly the colored graph isomorphism game of Roberson–Schmidt applied to the relation-colored graphs $I(M)$1 and $I(M)$2 (Corey et al., 8 Jul 2025).

3. Classical perfect strategies and ordinary matroid isomorphism

Because the game is synchronous, a perfect classical strategy is determined by a single function

$I(M)$3

Any ordinary matroid isomorphism $I(M)$4 yields such a strategy: on input $I(M)$5, the player answers $I(M)$6, and similarly uses $I(M)$7 on the other side (Corey et al., 8 Jul 2025).

The main classical theorem states the converse. If $I(M)$8 covers both $I(M)$9 and $C(M)$0, then the $C(M)$1-game has a perfect deterministic, equivalently classical, strategy if and only if $C(M)$2 and $C(M)$3 are isomorphic. Moreover, every perfect deterministic strategy arises from a matroid isomorphism $C(M)$4 preserving membership in the chosen structure $C(M)$5 (Corey et al., 8 Jul 2025).

This theorem has two immediate consequences. First, the game-theoretic characterization is cryptomorphism-invariant at the classical level: bases, circuits, flats, hyperplanes, and other covering structures all recover the same notion of isomorphism. Second, the formal game does not merely witness existence of an isomorphism; it reconstructs the underlying bijection on the ground sets from the induced bijection on pointed $C(M)$6-subsets. In this sense the classical game is complete for ordinary matroid isomorphism.

4. Quantum isomorphism, isomorphism algebras, and quantum automorphisms

The same game admits a quantum interpretation through perfect quantum commuting strategies. For a synchronous game, such a strategy can be described using a C$C(M)$7-algebra, projection-valued measurements, and a faithful tracial state. Specializing to the matroid isomorphism game yields a family of projections $C(M)$8 indexed by $C(M)$9, $\operatorname{rk}_M$0, satisfying row-sum, column-sum, and orthogonality relations; in particular,

$\operatorname{rk}_M$1

(Corey et al., 8 Jul 2025).

These relations are packaged into a universal algebra

$\operatorname{rk}_M$2

where $\operatorname{rk}_M$3 is the magic-unitary algebra on the index sets and $\operatorname{rk}_M$4 imposes the relation-preservation constraints. The principal algebraic characterization is that, for a covering structure $\operatorname{rk}_M$5, the $\operatorname{rk}_M$6-isomorphism game has a perfect quantum commuting strategy if and only if $\operatorname{rk}_M$7 (Corey et al., 8 Jul 2025). This gives a purely algebraic definition of $\operatorname{rk}_M$8-quantum isomorphism.

Quantum isomorphism is weaker than classical isomorphism but still preserves substantial combinatorial data. If $\operatorname{rk}_M$9 and $\operatorname{cl}_M$0 are $\operatorname{cl}_M$1-quantum isomorphic, then $\operatorname{cl}_M$2, and for each $\operatorname{cl}_M$3 the numbers of $\operatorname{cl}_M$4-sets of size $\operatorname{cl}_M$5 agree: $\operatorname{cl}_M$6 For $\operatorname{cl}_M$7 or $\operatorname{cl}_M$8, the two matroids must have the same rank and the same ground-set size; for $\operatorname{cl}_M$9, equal ranks force preservation of the paving property (Corey et al., 8 Jul 2025).

When $F(M)$0, the cocomposition on the magic-unitary algebra descends to a Hopf $F(M)$1-algebra $F(M)$2, yielding the $F(M)$3-quantum automorphism group $F(M)$4. Its commutative quotient recovers the classical automorphism group acting on pointed $F(M)$5-subsets, while noncommutativity witnesses genuinely quantum symmetry (Corey et al., 8 Jul 2025). A sufficient condition is available: if the relation-colored graph $F(M)$6 has two nontrivial disjoint automorphisms, then $F(M)$7 is noncommutative; the paper also gives a concrete matroid criterion in terms of four distinguished elements $F(M)$8 contained in two uniquely specified $F(M)$9-sets (Corey et al., 8 Jul 2025).

5. Explicit separations and rigid comparison classes

The decisive separation between classical and quantum behavior is supplied by a pair of rank-$S$00 sparse paving matroids constructed from the Mermin–Peres magic square. Starting from the rank-$S$01 matroid $S$02 on $S$03 with nonbases

$S$04

the construction doubles the ground set to $S$05 and prescribes sign constraints on the lifted cyclic hyperplanes. For the homogeneous choice $S$06 and the sign-twisted choice $S$07, both matroids have rank $S$08, $S$09 elements, and $S$10 nonbases. They are not isomorphic, but they are $S$11-quantum isomorphic because the corresponding linear binary constraint-system game has a perfect quantum strategy (Corey et al., 8 Jul 2025). This is the first explicit pair of nonisomorphic matroids known in the framework to be quantum isomorphic.

Several earlier arXiv results identify classes in which matroid isomorphism is already as rigid as graph isomorphism, making them natural testbeds for isomorphism games. For truncated cycle matroids, every $S$12-connected graph, except for $S$13, is uniquely defined by its truncated cycle matroid (Jesus et al., 2022). For forests, isotropic matroids and restricted isotropic matroids are classifying invariants: if $S$14 and $S$15 are forests, then graph isomorphism, restricted isotropic matroid isomorphism, and isotropic matroid isomorphism are equivalent (Traldi, 2020). These results show that in concrete graphic and binary settings the matroid-side comparison problem can coincide exactly with graph isomorphism.

A parallel representation-theoretic line appears for even cycle matroids. There the isomorphism problem is formulated for signed graphs representing the same even cycle matroid, and the comparison is mediated by explicit moves such as Whitney flips, signature exchange, Lovász flips, and several quad-template gadget moves (Guenin et al., 2011). Although this is not the same formalism as the 2025 nonlocal game, it supplies a combinatorial move system for navigating representation space.

6. Infinite-matroid determinacy and model-theoretic game analogues

Game-theoretic methods entered matroid theory before the nonlocal-game formulation through infinite matroids. For trees of finite matroids and sets of ends $S$16, circuit and cocircuit games were introduced so that the orthogonality axiom $S$17 is equivalent to determinacy of the corresponding game (Bowler et al., 2013). In the overlap-$S$18 setting, and again in the representable finite-field setting, the existence of the global infinite matroid is reduced to determinacy of these games; for Borel $S$19, Martin’s Borel determinacy theorem yields the induced matroid (Bowler et al., 2013). This is a different notion of “matroid game,” but it establishes a direct bridge between matroid axioms and infinite two-player game semantics.

Model-theoretic back-and-forth provides another analogue. A countable homogeneous universal simple matroid of rank $S$20, denoted $S$21, and the projective-plane-omitting variants $S$22, were constructed as Fraïssé limits in a language with a ternary dependence relation $S$23 and a $S$24-ary function $S$25 encoding line intersections (Paolini, 2017). Homogeneity means that every isomorphism between finite $S$26-subgeometries extends to an automorphism, which is precisely the structural content exploited in back-and-forth games. The same work establishes a stationary independence relation and shows that $S$27 embeds $S$28 (Paolini, 2017).

Taken together, these strands show that “matroid isomorphism games” names a convergence of several themes rather than a single technique. The finite nonlocal games of 2025 provide exact classical characterizations and genuinely quantum relaxations of matroid isomorphism (Corey et al., 8 Jul 2025). Earlier graphic, binary, and signed-graph results identify classes where matroid comparison is effectively graph comparison (Jesus et al., 2022, Traldi, 2020, Guenin et al., 2011). Infinite-matroid determinacy games and rank-$S$29 back-and-forth constructions show that game semantics also control matroid existence and automorphism structure well outside the finite nonlocal setting (Bowler et al., 2013, Paolini, 2017). This suggests a broad research program in which cryptomorphic axiomatizations, representation moves, operator-algebraic quantum symmetries, and classical partial-isomorphism techniques are treated as different game languages for the same underlying problem of recognizing matroid structure.