scientific article; zbMATH DE number 19186
From MaRDI portal
Publication:3976615
[For the entire collection see Zbl 0734.00014.] Let \(A=\{a_{jk}\}\), \(j=1,\dots,J\), \(k=1,\dots,K\), be a matrix. Let \(S(A)\) denote the set of elements of \(A\) (allowing repetitions of elements). We say that \(A\) is totally invertible if any subdeterminant of a matrix \(B\) with \(S(B)\subseteq S(A)\), does not vanish. Three constructions of totally invertible matrices of arbitrary magnitude are discussed. An interpretation of the above in terms of ``totally invertible machines is offered.
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976615)