On the partial ordering of almost definite matrices
Ar. Meenakshi (1989)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Remarks on inertia theorems for matrices”
On the partial ordering of almost definite matrices
Zero-term rank preservers of integer matrices
Seok-Zun Song, Young-Bae Jun (2006)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.
Fermat's theorem for matrices revisited
Štefan Schwarz (1985)
Mathematica Slovaca
Similarity:
Linear maps preserving rank 2 on the space of alternate matrices and their applications.
Cao, Chongguang, Tang, Xiaomin (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Preservers of the rank of matrices over a field.
Kalinowski, Józef (2009)
Beiträge zur Algebra und Geometrie
Similarity:
Spaces of rank-2 matrices over GF(2).
Beasley, LeRoy B. (1999)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: