A Note on Chessboard Matrices
The notion of a transfer (or T -transform) is central in the theory of majorization. For instance, it lies behind the characterization of majorization in terms of doubly stochastic matrices. We introduce a new type of majorization transfer called L-transforms and prove some of its properties. Moreover, we discuss how L-transforms give a new perspective on Ryser’s algorithm for constructing (0; 1)-matrices with given row and column sums.
We present a sufficient regularity condition for interval matrices which generalizes two previously known ones. It is formulated in terms of positive definiteness of a certain point matrix, and can also be used for checking positive definiteness of interval matrices. Comparing it with Beeck’s strong regularity condition, we show by counterexamples that none of the two conditions is more general than the other one.