---
title: Cycle Relevant Matrix (CRM) Overview
url: https://www.emergentmind.com/topics/cycle-relevant-matrix-crm
type: topic
---

# Cycle Relevant Matrix (CRM) Overview

“Cycle Relevant Matrix” (CRM) is not a single standardized object across the arXiv literature. In the supplied nomenclature, it names several matrices whose entries encode cycle-relevant structure in distinct domains: the cycle consistency matrix used to characterize absorbing sets in separable circulant-based LDPC codes, the cycle matrix associated with non-degenerate cycle sets and involutive set-theoretic solutions of the Quantum Yang–Baxter equation, and the set matrix \(S_k\) whose diagonal detects \(k\)-cycles in directed graphs. The same acronym also appears independently as “Convergent r-Matrix,” which is unrelated to cycle encoding and instead concerns finite-dimensional matrix encodings of the position operator [1208.6094], [2303.09398], [0709.4273], [2403.02519].

## 1. Terminological scope and domain-specific meanings

The term CRM is introduced in the supplied material as a nomenclature mapping rather than as a canonical term native to all cited papers. In coding theory, the paper “The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes” identifies the cycle consistency matrix (CCM) with the CRM: it is the matrix of modular cycle constraints that must vanish for a candidate absorbing-set topology to be realizable in a separable circulant-based code [1208.6094]. In the Quantum Yang–Baxter literature, the paper “Cycle matrices: A combinatorial approach to the set-theoretic solutions of the Quantum Yang–Baxter Equation” uses “cycle matrix” for an \(n\times n\) matrix \(M=[m_{ij}]\) encoding the operation \(i\cdot j=m_{ij}\) on \(U_n=\{1,\dots,n\}\), and the supplied mapping identifies that object with the CRM [2303.09398]. In graph algorithms, “Set Matrices and The Path/Cycle Problem” does not use the term CRM explicitly; the supplied mapping defines the CRM for cycle length \(k\) to be the paper’s diagonal cycle-detection matrix \(S_k\) [0709.4273].

| Literature | Matrix identified as CRM | Function |
|---|---|---|
| SCB LDPC codes | Cycle consistency matrix (CCM) | Encodes modular cycle constraints for absorbing sets |
| Cycle sets / QYBE | Cycle matrix \(M=[m_{ij}]\) | Encodes the cycle operation \(i\cdot j\) |
| Graph path/cycle problem | Set matrix \(S_k\) | Detects \(k\)-cycles through diagonal entries |
| Position-operator theory | Convergent r-Matrix | Unrelated acronym usage |

This plurality of meanings is substantive rather than cosmetic. In each case, the matrix records a different kind of cycle information: congruence constraints in Tanner graphs, binary operations satisfying the cycle law, or existence of graph cycles of fixed length. The shared label therefore denotes a family resemblance at the level of function, not a single algebraic formalism.

## 2. CRM as cycle consistency matrix in SCB LDPC codes

In separable circulant-based (SCB) LDPC coding, the CRM is the cycle consistency matrix attached to a candidate absorbing-set subgraph. The underlying setting is an LDPC Tanner graph \(G_H=(V,F,E)\), where an \((n_v,n_o)\) absorbing set is a variable-node subset \(V_{as}\subset V\) such that \(|V_{as}|=n_v\), \(|o(V_{as})|=n_o\), and every variable node in \(V_{as}\) has strictly fewer neighbors in the odd-degree checks \(o(V_{as})\) than in the even-degree checks \(e(V_{as})\). A fully absorbing set imposes the analogous strict inequality for every variable node outside \(V_{as}\). The paper treats absorbing sets as a principal cause of the error floor for LDPC codes under limited-precision message-passing decoding on AWGN channels, with small absorbing sets tending to dominate because they are more easily activated [1208.6094].

SCB codes form a large subclass of regular quasi-cyclic LDPC codes. Their parity-check matrices are block-circulant with circulant size \(p\), typically prime, and take the form
\[
H_{p,f}^{r,c}=
\begin{bmatrix}
\sigma^{f(0,0)} & \sigma^{f(0,1)} & \cdots & \sigma^{f(0,c-1)}\\
\sigma^{f(1,0)} & \sigma^{f(1,1)} & \cdots & \sigma^{f(1,c-1)}\\
\vdots & \vdots & \ddots & \vdots\\
\sigma^{f(r-1,0)} & \sigma^{f(r-1,1)} & \cdots & \sigma^{f(r-1,c-1)}
\end{bmatrix},
\]
with \(\sigma\) the \(p\times p\) circulant permutation matrix and separability
\[
f(i,j)=g_r(i)\,g_c(j)\bmod p.
\]
All SCB codes over a fixed \(p\) derive from the mother matrix \(H_{p,f_m}^{p,p}\) with \(f_m(i,j)=i\,j\bmod p\). Variable nodes are labeled \((j,k)\), check nodes \((i,l)\), and the graph obeys Bit Consistency, Check Consistency, and Pattern Consistency. The cycle constraints are captured by
\[
\sum_{m=1}^t i_m\bigl(j_{(m+1)\bmod t}-j_m\bigr)=0 \bmod p,
\]
for any length-\(2t\) cycle with variable-group labels \(j_1,\dots,j_t\) and check-group labels \(i_1,\dots,i_t\).

For an absorbing set with variable-group labels \(j_1,\dots,j_{n_v}\), the paper defines
\[
u_m=j_m-j_1,\qquad m\in\{2,\dots,n_v\},
\]
and rewrites the cycle equations as linear congruences in the vector \(\mathbf{u}=[u_2,\dots,u_{n_v}]\):
\[
\sum_{m=2}^t (i_{m-1}-i_m)u_m=0\bmod p.
\]
Choosing one row per linearly independent cycle produces the CRM/CCM \(\mathbf M\), so that
\[
\mathbf M\mathbf u=0\bmod p.
\]
Its rows correspond to linearly independent cycles, its columns to variable-node column-group differences, and an efficient construction uses exactly \(D_{bcs}\) rows, where \(D_{bcs}\) is the dimension of the binary cycle space. When all check degrees in the absorbing-set subgraph are at most \(2\), the paper passes to the VN graph and computes \(D_{bcs}\) as the nullity of the VN-graph incidence matrix over \(GF(2)\).

The central existence criterion is stated as Theorem 1. For a proposed absorbing-set graph \(G_{as}\) with all variables in at least one cycle, and with prescribed row-group and column-group labels inherited from the SCB mother matrix, the following are necessary for the absorbing set to exist in every daughter SCB code selecting those groups: the CRM does not have full column-rank over \(GF(p)\), equivalently it has a nontrivial null space; the variable nodes satisfy Check Consistency and produce a difference vector \(\mathbf u\) in that nullspace; and each check satisfies Bit Consistency. If the VN graph is non-extensible, these conditions are also sufficient.

The paper gives explicit CRMs for several small absorbing-set topologies. For the \((4,8)\) absorbing set,
\[
\mathbf{M}=
\begin{bmatrix}
i_1-i_2 & i_2-i_5 & 0\\
i_1-i_6 & 0 & i_6-i_4\\
0 & i_5-i_3 & i_3-i_4
\end{bmatrix},
\]
with determinant
\[
\det\mathbf M=-(i_1-i_2)(i_6-i_4)(i_5-i_3)-(i_2-i_5)(i_1-i_6)(i_3-i_4).
\]
For the \((5,9)\) absorbing set, an efficient CRM is
\[
\mathbf{M}=
\begin{bmatrix}
i_1-i_5 & i_5-i_2 & 0 & 0\\
i_1-i_8 & 0 & 0 & i_8-i_4\\
0 & i_2-i_6 & i_6-i_3 & 0\\
0 & 0 & i_3-i_7 & i_7-i_4
\end{bmatrix},
\]
and its determinant factors as
\[
\det \mathbf M =
(i_1-i_5)(i_8-i_4)(i_2-i_6)(i_3-i_7)
-(i_1-i_8)(i_5-i_2)(i_6-i_3)(i_7-i_4)\bmod p.
\]
For the \((4,2)\) absorbing set at \(r=3\),
\[
\mathbf{M}=
\begin{bmatrix}
i_1-i_2 & i_2-i_5 & 0\\
0 & i_5-i_3 & i_3-i_4
\end{bmatrix}.
\]
These formulas make the CRM a direct mechanism for converting graphical feasibility into modular linear algebra.

## 3. CRM-guided code design, multiplicity, and performance in LDPC constructions

Because absorbing-set existence requires a nontrivial CRM nullspace, the design principle in SCB LDPC codes is to choose the row-selection function \(g_r\), the column-selection function \(g_c\), and the circulant size \(p\) so that the relevant CRMs have trivial nullspace, equivalently full column-rank, for the targeted small topologies [1208.6094]. The paper emphasizes that this is especially useful in the high-rate regime, where the variable-node degree \(r\) is small, such as \(r=4\) or \(r=5\), and small absorbing sets are otherwise prevalent. Lower-rate SCB codes often have larger \(r\), which increases the number of satisfied checks per variable and tends to make avoidance easier.

For \(r=5\), row selection alone can eliminate several dominant absorbing sets. To avoid \((4,8)\) absorbing sets, the determinant expressions associated with the admissible row-group labelings must remain nonzero modulo \(p\). Explicit examples are given: the RSF \([0,1,2,4,6]\) avoids all \((4,8)\) absorbing sets for \(p>23\), and \([0,1,3,8,19]\) avoids all \((4,8)\) absorbing sets for \(p=47\) and certain other primes. For \((5,9)\), the RSF \([0,1,2,4,7]\) avoids \((5,9)\) for \(p>89\) except the finite set \(\{101,103,131,179\}\). Theorem 7 states that for \(r=5\) SR-SCB codes, with proper RSF and sufficiently large \(p\), all \((4,8)\), \((5,9)\), and \((6,8)\) absorbing sets can be precluded. The paper also lists good RSFs such as \([0,1,2,4,17]\) for \(p\ge 67\), \([0,1,2,3,11]\), \([0,1,2,6,7]\), \([0,1,2,3,7]\), and \([0,1,2,4,11]\), each with a minimal \(p\) threshold beyond which all three targeted structures are avoided.

For \(r=4\), the dominant structures are \((6,4)\) absorbing sets, and some configurations cannot be eliminated by row selection alone. The prescribed remedy is shortening through column selection: one chooses a subset of column groups \(g_c\) so that no dangerous \(6\)-tuple of column-group labels remains in the solution set of \(\mathbf M\mathbf u=0\bmod p\). The paper describes two greedy procedures, column-cutting and column-adding, to enforce \(V\cap \tilde V=\varnothing\), where \(V\) is the set of allowable \(6\)-tuples of column labels and \(\tilde V\) is the set producing the absorbing sets. It also notes that shortening reduces rate but does not introduce smaller absorbing sets.

The CRM framework also yields multiplicity information. In EAB codes, small absorbing sets often occur with multiplicity scaling as \(\Theta(p^3)\). Corollary 2 states that \((4,8)\) absorbing sets exist in every \(r=5\) EAB code and the total multiplicity is \(\Theta(p^3)\); Corollary 5 gives the same \(\Theta(p^3)\) scaling for \((5,9)\) in \(r=5\) EAB codes. Certain \((6,8)\) configurations likewise occur with multiplicity \(\Theta(p^3)\), although many contain \((4,8)\) subgraphs and disappear once the smaller topology is eliminated.

The search space for good RSFs is reduced by equivalence. RSFs are equivalent under addition of a constant modulo \(p\), multiplication by a nonzero constant modulo \(p\), and equivalence of difference matrices including antidiagonal reflections. Any RSF is therefore equivalent to one of the form \([0,1,x,y,z]\). For \(p=67\), the paper reports \(2192\) such equivalence classes, of which \(63\) class leaders avoid all \((4,8)\), \((5,9)\), and \((6,8)\) absorbing sets.

The computational pipeline is correspondingly explicit: specify the absorbing-set topology, identify linearly independent cycles, assemble the CRM from the cycle equations, enforce Bit and Check Consistency, and compute the rank of \(\mathbf M\) over \(GF(p)\). For small absorbing sets, both \(D_{bcs}\) and \(n_v\) are small, so rank computation is an \(O((n_v)^3)\) operation on small matrices. Simulation results connect this algebraic elimination to decoder behavior. Under limited-precision SPA and SXOR decoding, including Q4.2 quantization and \(200\) iterations, CRM-optimized codes exhibit steeper error-floor slopes and “one order of magnitude of improvement in the low FER region.” For \((2209,1978)\) codes at \(p=47\), the SR-SCB code with RSF \([0,1,3,8,19]\) eliminates all \((4,8)\) absorbing sets and outperforms EAB and Huang et al. constructions under both SPA and SXOR. For \((4489,4158)\) codes at \(p=67\), the SR-SCB choice \([0,1,2,4,17]\) eliminates \((4,8)\), \((5,9)\), and \((6,8)\), with corresponding BER improvement.

## 4. CRM as cycle matrix in cycle sets and set-theoretic QYBE

In the cycle-set literature, the CRM is the cycle matrix \(M=[m_{ij}]\in U_n^{n\times n}\), where \(U_n=\{1,2,\dots,n\}\) and the matrix defines a binary operation by \(i\cdot j=m_{ij}\). The matrix qualifies exactly when \((U_n,\cdot)\) is a non-degenerate cycle set: for each \(x\), the map \(\psi_x(y)=x\cdot y\) is bijective; the cycle law
\[
(x\cdot y)\cdot (x\cdot z)=(y\cdot x)\cdot (y\cdot z)
\]
holds for all \(x,y,z\); and the diagonal map \(\phi(x)=x\cdot x\) is bijective. Square-free cycle sets are those with \(\phi=\mathrm{id}_X\). Writing the \(i\)-th row as a permutation \(\sigma_i\in S_n\), where \(\sigma_i(j)=m_{ij}\), the cycle law is equivalent to
\[
\sigma_{\sigma_i(j)}\circ \sigma_i=\sigma_{\sigma_j(i)}\circ \sigma_j
\]
for all \(i,j\) [2303.09398].

This yields a complete criterion for determining whether a given matrix is a CRM in this sense: each row must be a permutation of \(U_n\); the diagonal entries must themselves form a permutation of \(U_n\); and the row permutations must satisfy the cycle-law identity above. The paper gives an algorithmic verification cost of \(O(n^2)\) for the row-permutation test, \(O(n)\) for the diagonal permutation test, and worst-case \(O(n^3)\) for checking the cycle law.

The matrix is structurally tied to involutive set-theoretic solutions of the Quantum Yang–Baxter equation through Rump’s correspondence between non-degenerate cycle sets and non-degenerate involutive solutions. The explicit solution attached to the CRM is
\[
r(i,j)=\bigl(\sigma_i(j),\,\sigma_{\sigma_i(j)}^{-1}(i)\bigr),
\]
equivalently
\[
r(i,j)=\bigl(\psi_i(j),\,\psi_{\psi_i(j)}^{-1}(i)\bigr).
\]
The cycle matrix therefore serves not only as a storage device for the operation \(i\cdot j\) but as a constructive object from which the QYBE solution is recovered.

The paper develops several structural operations on these matrices. If \((U_m,\cdot)\) and \((U_n,\star)\) are cycle sets, then \((U_m\times U_n,\circ)\) with
\[
(a,b)\circ(c,d)=(a\cdot c,\,b\star d)
\]
is again a cycle set, and under the relabeling \(\phi(i,j)=(i-1)n+j\), the corresponding cycle matrix is the tensor product \(A\otimes B\). The retraction construction identifies elements \(x\sim y\) when \(\psi_x=\psi_y\), forms \(\mathrm{Ret}(X)=X/{\sim}\), and defines the multipermutation level as the least \(n\) with \(|\mathrm{Ret}^n(X)|=1\). Using block cycle matrices, the paper constructs level-\(2\) solutions and, by an iterative doubling scheme beginning with \(X_2\), constructs a multipermutation solution of level \(r\) for every \(r\ge 1\).

The matrix also supports classification statements. There is an \(S_n\)-action on the set \(C_n\) of cycle matrices given by
\[
(\sigma\cdot M)_{ij}=\sigma\bigl(\sigma^{-1}(i)\star \sigma^{-1}(j)\bigr),
\]
and two cycle matrices determine isomorphic solutions if and only if they lie in the same orbit. The stabilizer of a matrix is the automorphism group \(\mathrm{Aut}(U_n,\cdot)\). The paper further states that if the permutation group generated by the rows acts intransitively, then the determinant of the symbolic matrix vanishes; consequently, a non-zero determinant implies indecomposability, although the converse fails. It also proves that every finite abelian group occurs as the permutation group of a non-degenerate involutive solution obtained by these cycle-matrix constructions.

## 5. CRM as a set-matrix detector of graph cycles

In the graph-theoretic framework of set matrices, the CRM for cycle length \(k\) is the matrix \(S_k\), whose diagonal entries detect the existence of \(k\)-cycles attached to individual vertices. The paper works with a directed multigraph \(g=(V,A)\), where \(V=\{v_1,\dots,v_n\}\) is also the universal set used inside the matrix entries. A set matrix is a matrix \(M=(m_{ij})\) whose entries are subsets of \(V\), and the key multiplication for path filtering is
\[
(AB)_{ij}=
\begin{cases}
\displaystyle \bigcap_{\mu=1}^{m}\bigl(a_{i\mu}\cup b_{\mu j}\bigr), & i\ne j,\\[6pt]
V, & i=j.
\end{cases}
\]
Because of the special treatment of the diagonal, this multiplication is explicitly non-associative [0709.4273].

Two adjacency-derived set matrices are defined. The finish-label matrix \(T=(t_{ij})\) stores \(\{v_j\}\) in position \((i,j)\) when there is an arc \(v_i\to v_j\) with \(i\ne j\), and \(V\) otherwise. The start-label matrix \(R=(r_{ij})\) stores \(\{v_i\}\) under the analogous condition and \(V\) otherwise. Their recursively defined powers \(T_k\) and \(R_k\) support fixed-length path detection. The key theorem for paths is
\[
\text{there exists a \(k\)-path from } v_i \text{ to } v_j
\iff
(T_k)_{ij}\ne V.
\]

Cycles require a different multiplication that reads only the diagonal:
\[
(AB)_{ij}=
\begin{cases}
V, & i\ne j,\\[4pt]
\displaystyle \bigcap_{v=1}^{n} A_{iv}\cup B_{vi}, & i=j.
\end{cases}
\]
The base cycle matrix \(S_1\) records loops by setting \((S_1)_{ii}=\{\mathrm{Loop}\}\) when \(G_{ii}>0\), and \(V\) otherwise. For \(k\ge 1\),
\[
S_{k+1}=T_k R_1.
\]
Under the CRM identification, \(\mathrm{CRM}(k)=S_k\).

The central cycle theorem is then
\[
\text{there exists a \(k\)-cycle attached to } v_i
\iff
(S_k)_{ii}\ne V.
\]
Only the diagonal entries of the CRM matter, since the off-diagonal entries are set to \(V\) by definition. The matrix therefore does not enumerate cycles in the usual adjacency-matrix sense; instead, it acts as a set-theoretic filter whose nontrivial diagonal entries certify cycle existence of a fixed length.

The computational profile is also explicit. Naively computing the path powers costs
\[
O\bigl(k n^3 |V|\bigr),
\]
and computing a single cycle matrix \(S_k\) from \(T_{k-1}\) and \(R_1\) costs \(O(n^2 |V|)\), dominated by the path-power step. For all paths and cycles of lengths up to \(n\), the worst-case total time is \(O(n^5)\) on complete graphs. The paper notes a Hamiltonian-cycle optimization: by computing only a single row or column of \(T_{n-1}\), detection can be reduced to \(O(n^4)\). The CRM in this setting is therefore a diagonal diagnostic for fixed-length cycle membership, embedded in a non-associative set-matrix calculus.

## 6. Common structural themes and acronym ambiguity

Across these three cycle-centered usages, the CRM is always a matrix that compresses cycle information into a form amenable to algebraic testing, but the algebra being used changes completely from one domain to another. In SCB LDPC coding, the entries lie in modular arithmetic and the decisive event is a nontrivial nullspace of \(\mathbf M\) over \(GF(p)\). In cycle-set theory, the matrix entries lie in \(U_n\), each row is a permutation, and admissibility is controlled by the cycle law \(\sigma_{\sigma_i(j)}\circ \sigma_i=\sigma_{\sigma_j(i)}\circ \sigma_j\). In graph algorithms, the entries are subsets of a vertex set, the multiplication is non-associative, and cycle existence is read off from whether diagonal entries differ from the universal set. The shared function is thus representational: each CRM turns a cycle-existence or cycle-compatibility problem into a matrix condition.

The papers also differ in what the matrix certifies. The LDPC CRM is local to a prescribed absorbing-set topology and is used to prove presence, absence, multiplicity scaling, and code-design constraints. The QYBE CRM is global: it defines an entire algebraic structure \((U_n,\cdot)\), from which one derives the associated involutive solution, retractions, tensor products, and automorphisms. The graph-theoretic CRM is length-indexed and vertex-indexed: \(S_k\) answers whether a \(k\)-cycle is attached to a given vertex, without serving as a presentation of an independent algebraic object.

The acronym itself is ambiguous beyond cycle-related contexts. The paper “Position operators in terms of converging finite-dimensional matrices: Exploring their interplay with geometry, transport, and gauge theory” uses CRM to mean “Convergent r-Matrix,” a finite-dimensional encoding of the position operator \(\hat r\). That CRM is explicitly not a finite-dimensional representation of the Weyl algebra, because finite-dimensional matrices cannot satisfy \([A,B]=iI\) owing to the trace obstruction. Its role is to replace the divergent diagonal term in the conventional \(r\)-matrix by a finite construction on a discretized product space \(\mathcal V\otimes E\), with the reduced matrix
\[
r_{m,n}^{(\mathcal N)}(k)=A_{m,n}(k)+\delta_{m,n}\,\bar R
\]
and inhomogeneous transformation law characteristic of differential operators rather than Lie-algebra matrices [2403.02519].

The literature therefore contains both a family of cycle-centered CRM mappings and an unrelated acronymic use. In the cycle-centered cases, CRM is best understood not as a single universal object but as a domain-specific matrix formalism whose common purpose is to encode cycle-relevant constraints, operations, or existence tests in a tractable algebraic language.

Source: https://www.emergentmind.com/topics/cycle-relevant-matrix-crm