AbstractThe existence of even or odd diagonals in doubly stochastic matrices depends on the number of positive elements in the matrix. The optimal general lower bound in order to guarantee the existence of such diagonals is determined, as well as their minimal number for given number of positive elements. The results are related to the characterization of even doubly stochastic matrices in connection with Birkhoff's algorithm
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.