Safe’s Matrix Recognition Framework

• The paper introduces a linear-time framework that characterizes forbidden configurations in binary matrices via the circular-ones and circularly compatible ones properties.
• It details key operations like row-complementation and configuration-equivalence to systematically enforce structural properties within co-bipartite graphs.
• The framework unifies matrix-theoretic and graph-theoretic methods, yielding efficient algorithms for recognizing semi-transitive orientations and word-representable graphs.

Safe’s Matrix Recognition Framework is a structural and algorithmic approach for recognizing properties of binary matrices—particularly “circular-ones-type” properties—via the identification of forbidden configurations. This framework provides a unified methodology that enables linear-time recognition algorithms and supports the structural study of various matrix classes, most notably in the characterization of word-representable co-bipartite graphs, by connecting matrix-theoretic properties to graph orientation properties (Srinivasan et al., 13 Dec 2025).

1. Foundational Concepts: Configurations and Matrix Operations

A key construct in Safe’s framework is the containment of configurations. For a binary $m\times n$ matrix $M = (m_{ij})$ and a smaller binary matrix $N$, $M$ contains $N$ as a configuration if some $p$ distinct rows and $q$ distinct columns form a submatrix equivalent to $N$ up to arbitrary row and column permutations. Two matrices are configuration-equivalent if each contains the other as a configuration.

Row-complementation is fundamental: given a binary mask $a \in \{0,1\}^m$, the matrix $aM$ is formed by complementing each row $M = (m_{ij})$0 of $M = (m_{ij})$1 whenever $M = (m_{ij})$2. The operation $M = (m_{ij})$3 denotes $M = (m_{ij})$4 with a single all-zero column appended to the right. These notions underpin the systematic search for substructures violating targeted matrix properties.

2. Forbidden Configuration Characterization

Safe’s master theorem asserts that, for any circular-ones-type matrix property $M = (m_{ij})$5, there exists a (finite or infinite) family $M = (m_{ij})$6 of forbidden matrices such that a matrix $M = (m_{ij})$7 possesses property $M = (m_{ij})$8 if and only if it contains no member of $M = (m_{ij})$9 as a configuration. Critically, if all forbidden matrices are of constant size, one can design a linear-time recognition algorithm that either constructs a witness (such as an ordering) certifying $N$0, or finds an explicit obstruction (Srinivasan et al., 13 Dec 2025).

This approach leverages the following structure:

Term	Description
Configuration	Pattern-matching up to row/col permutations
Row-complementation	Flipping entries of specified rows using a binary mask
Configuration-equivalence	Bidirectional containment as configurations

3. The Circularly Compatible Ones Property

In the context of co-bipartite graphs, the matrix property corresponding to semi-transitivity is the circularly compatible ones property. For a binary $N$1 matrix $N$2 with row index set $N$3 and column index set $N$4, $N$5 has the circularly compatible ones property if there exist:

• A linear order $N$6 on $N$7 and $N$8 on $N$9.
• For every row $M$0, the set of columns with ones forms a circular interval in $M$1.
• Dually, for every column $M$2, the set of rows with ones forms a circular interval in $M$3.
• The left and right endpoints of these intervals, ordered by the row sequence, form sequences that are circularly monotone.

A circular interval on $M$4 is, relative to a fixed linear order, an interval that may “wrap around” the set (i.e., the union of two terminal intervals if needed).

Safe demonstrates (Theorem 4.7) the following equivalence for any $M$5 binary matrix $M$6:

1. $M$7 has the circularly compatible ones property.
2. $M$8 contains no member of the infinite forbidden family $M$9 as a configuration.
3. $N$0 has the circular-ones property on both rows and columns and avoids a finite core obstruction list $N$1.
4. $N$2 satisfies the doubly $N$3-circular property (a purely interval-ordering condition).

$N$4 consists of four constant-size obstructions ($N$5, $N$6, $N$7, $N$8; each at most $N$9), and two infinite families $p$0 and $p$1; $p$2 is the $p$3 matrix where each row is all 1's except for a cyclically positioned 0, and $p$4 is the row-complement.

4. Linear-Time Recognition Algorithm

Theorem 4.8 of Safe’s work provides a recognition algorithm for circularly compatible ones in $p$5 time, where:

$p$6

The algorithm comprises:

• Input: $p$7 binary matrix $p$8 in sparse list-of-ones format.
• Process: Attempt to find a circularly compatible biorder $p$9 or a forbidden configuration $q$0 in $q$1.
• Output: The biorder if the property holds, or an explicit forbidden submatrix certifying failure.

Application to co-bipartite graphs: For a co-bipartite graph $q$2, form its bipartite adjacency matrix $q$3; execute Safe’s algorithm. Its linear complexity $q$4 follows since building $q$5 requires $q$6 and the subroutine is linear in matrix size.

Correctness is established as: $q$7 is semi-transitive $q$8 $q$9 has the circularly compatible ones property $N$0 Safe's subroutine identifies a biorder rather than a forbidden $N$1.

5. Connection to Word-Representable Co-bipartite Graphs

Safe’s matrix recognition framework is central to the forbidden subgraph characterization of word-representable co-bipartite graphs, a subclass where the vertex set partitions into two cliques. In this setting, semi-transitivity of the graph aligns precisely with the circularly compatible ones property on its bipartite adjacency matrix. Thus, the structural and algorithmic results for matrices translate directly into graph-theoretic criteria and algorithms (Srinivasan et al., 13 Dec 2025).

An explicit workflow for recognizing semi-transitive co-bipartite graphs is:

1. Partition $N$2 into cliques $N$3 and $N$4.
2. Form $N$5; $N$6 iff $N$7 adjacent to $N$8.
3. Run Safe's subroutine on $N$9.
4. If a biorder is returned, $a \in \{0,1\}^m$0 is semi-transitive; otherwise, the forbidden configuration corresponds to a minimal forbidden word-representable subgraph.

6. Illustrative Examples

To demonstrate the framework’s operation, consider the following cases:

• Example 4.1: $a \in \{0,1\}^m$1 with $a \in \{0,1\}^m$2, $a \in \{0,1\}^m$3 and edges $a \in \{0,1\}^m$4. Its adjacency matrix

$a \in \{0,1\}^m$5

satisfies the circularly compatible ones property with natural row and column orders, so the algorithm returns the biorder.

• Example 4.2: $a \in \{0,1\}^m$6 with $a \in \{0,1\}^m$7, $a \in \{0,1\}^m$8 and edges $a \in \{0,1\}^m$9, leading to

$aM$0

Safe’s subroutine identifies the forbidden $aM$1 pattern in $aM$2, so the algorithm outputs a certificate of non-semi-transitivity, corresponding to the minimal forbidden subgraph $aM$3.

7. Broader Context and Significance

Safe’s matrix recognition framework synthesizes matrix-theoretic and graph-theoretic perspectives, providing a general strategy for aligning structural properties with concise forbidden configuration principles. The linear-time recognition algorithm marks a significant advance in algorithmic graph theory, especially for subclasses such as co-bipartite and permutation graphs. Its connections with word-representable graphs, semi-transitive orientations, and forbidden subgraph theory unify disparate strands in combinatorics and algorithm design (Srinivasan et al., 13 Dec 2025).

A plausible implication is that similar forbidden configuration frameworks may be extended to other matrix and graph classes exhibiting circular or interval-based structural constraints, supporting efficient recognition and classification.