Some mixed matrix problems over several discrete valuation rings (Q530172)

The first result shows that such a matrix can be reduced to a matrix of the form \(\begin{bmatrix} I&0\\ 0&0 \end{bmatrix}\) by means of left \(O_1\)-elementary transformations of rows, and right \(O_2\)-elementary transformations of columns. Then, the author proves that finding all indecomposable matrices in the following two cases is of unbounded representation type: {\parindent=6mm \begin{itemize}\item[1.] The admissible transformations are left \(O_1\!\cap \!O_2\)-elementary transformations of rows, and right \(D\)-elementary transformations of columns. \item[2.] The matrix is partitioned into two vertical strips \(T=\left[ A_1\mid A_2\right]\), and the admissible transformations are \(O_1\)-elementary transformations of rows of \(T\), \(O_2\)-elementary transformations of columns of \(A_1\), \(D\)-elementary transformations of columns of \(A_2\). \end{itemize}}