Pseudoprime factorizations of integer matrices (Q927759)

Let \(\mathbb Z^{n\times n}\) be the set of \(n\times n\) matrices with integer entries. The authors define an injection \(\Phi_{i,j}\) from \(\mathbb Z^{2\times2}\) into \(\mathbb Z^{n\times n}\) that preserves the determinant. They show: Let \(C \in\mathbb Z^{n\times n}\), \(n\geq 2\). Also let \(\Phi_{i,j}\), where \(i > j\), be as described above. Then \(C\) has a factorization \(C=[\prod_{i=2}^n \prod_{j=1}^{i-1} \Phi_{i,j}(K_{i,j})] \cdot P_C\), where each \(K_{i,j}\in SL(2,\mathbb Z)\), and \(P_C\) is upper triangular. Also, the product denotes multiplication on the right in the order given. This factorization is not unique. The authors consider specializations, certain uniqueness conditions, and an algorithm for factorization. They also mention possible applications.