Given a real matrix A of order n xn , we can permute its ei~ments in ( . : t ! ditteren! ways. Any matrix obtained from such a permutation i~ called a rearrangement of A. We denote by R ( A ) the set of rearrangemeni:s of A. Let us denote by /~{A). the set of matrices B in R(A) , whose e[ements do not mcrea~e in each row and column, that i:: (b,i)~'= I is a non-increasing sequence for every 1 ~ i ~ n, and (b,):' , is a non-increasing :equence for every I ~ / ~ n. For any matrix A. we dcm)te by… CONTINUE READING