Javascript must be enabled to continue!
Some Results on Majorization of Matrices
View through CrossRef
For two n×m real matrices X and Y, X is said to be majorized by Y, written as X≺Y if X=SY for some doubly stochastic matrix of order n. Matrix majorization has several applications in statistics, wireless communications and other fields of science and engineering. Hwang and Park obtained the necessary and sufficient conditions for X,Y to satisfy X≺Y for the cases where the rank of Y=n−1 and the rank of Y=n. In this paper, we obtain some necessary and sufficient conditions for X,Y to satisfy X≺Y for the cases where the rank of Y=n−2 and in general for rank of Y=n−k, where 1≤k≤n−1. We obtain some necessary and sufficient conditions for X to be majorized by Y with some conditions on X and Y. The matrix X is said to be doubly stochastic majorized by Y if there is S∈Ωm such that X=YS. In this paper, we obtain some necessary and sufficient conditions for X to be doubly stochastic majorized by Y. We introduced a new concept of column stochastic majorization in this paper. A matrix X is said to be column stochastic majorized by Y, denoted as X⪯cY, if there exists a column stochastic matrix S such that X=SY. We give characterizations of column stochastic majorization and doubly stochastic majorization for (0,1) matrices.
Title: Some Results on Majorization of Matrices
Description:
For two n×m real matrices X and Y, X is said to be majorized by Y, written as X≺Y if X=SY for some doubly stochastic matrix of order n.
Matrix majorization has several applications in statistics, wireless communications and other fields of science and engineering.
Hwang and Park obtained the necessary and sufficient conditions for X,Y to satisfy X≺Y for the cases where the rank of Y=n−1 and the rank of Y=n.
In this paper, we obtain some necessary and sufficient conditions for X,Y to satisfy X≺Y for the cases where the rank of Y=n−2 and in general for rank of Y=n−k, where 1≤k≤n−1.
We obtain some necessary and sufficient conditions for X to be majorized by Y with some conditions on X and Y.
The matrix X is said to be doubly stochastic majorized by Y if there is S∈Ωm such that X=YS.
In this paper, we obtain some necessary and sufficient conditions for X to be doubly stochastic majorized by Y.
We introduced a new concept of column stochastic majorization in this paper.
A matrix X is said to be column stochastic majorized by Y, denoted as X⪯cY, if there exists a column stochastic matrix S such that X=SY.
We give characterizations of column stochastic majorization and doubly stochastic majorization for (0,1) matrices.
Related Results
Subespacios hiperinvariantes y característicos : una aproximación geométrica
Subespacios hiperinvariantes y característicos : una aproximación geométrica
The aim of this thesis is to study the hyperinvariant and characteristic subspaces of a matrix, or equivalently, of an endomorphism of a finite dimensional vector space. We restric...
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
La present memòria estudia l'estabilitat estructural de ternes de matrius. Es ben conegut que els sistemes dinàmic lineals amb coeficients constants poden venir definits per ternes...
Right gut-majorization on M_{n,m}
Right gut-majorization on M_{n,m}
Let M_{n,m} be the set of all n-by-m matrices with entries from R, and suppose that R^n is the set of all 1-by-n real row vectors. A matrix R is called generalized row stochastic (...
Majorization property for specific classes of analytic functions
Majorization property for specific classes of analytic functions
The majorization property plays a significant role in understanding the behavior of certain classes of analytic functions and their mappings. In this research, we introduce two nov...
Group theoretical classification of SIC-POVMs
Group theoretical classification of SIC-POVMs
Abstract
The Symmetric Informationally Complete Positive Operator-Valued Measures (SIC-POVMs) are known to exist in all dimensions
...
SCHUR MULTIPLICATIVE MAPS ON MATRICES
SCHUR MULTIPLICATIVE MAPS ON MATRICES
AbstractThe structure of Schur multiplicative maps on matrices over a field is studied. The result is then used to characterize Schur multiplicative maps f satisfying $f(S) \subset...
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application
Maximum distance separable (MDS) codes introduce MDS matrices which not only have applications in coding theory but also are of great importance in the design of block ciphers. It ...
Random Matrices
Random Matrices
Large complex systems tend to develop universal patterns that often represent their essential characteristics. For example, the cumulative effects of independent or weakly dependen...

