The maximal and minimal ranks of with applications.
Tian, Yongge, Cheng, Shizhen (2003)
The New York Journal of Mathematics [electronic only]
Similarity:
Tian, Yongge, Cheng, Shizhen (2003)
The New York Journal of Mathematics [electronic only]
Similarity:
Berman, Avi, Friedland, Shmuel, Hogben, Leslie, Rothblum, Uriel G., Shader, Bryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Cao, Chongguang, Tang, Xiaomin (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Beasley, LeRoy B. (1999)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Štefan Schwarz (1985)
Mathematica Slovaca
Similarity:
Vincenzo Nesi, Enrico Rogora (2007)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
The theory of compensated compactness of Murat and Tartar links the algebraic condition of rank- convexity with the analytic condition of weak lower semicontinuity. The former is an algebraic condition and therefore it is, in principle, very easy to use. However, in applications of this theory, the need for an efficient classification of rank- convex forms arises. In the present paper, we define the concept of extremal -forms and characterize them in the rotationally invariant...
Mortici, Cristinel (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity: