Diagonal sums of doubly substochastic matrices

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

Let Ω n denote the convex polytope of all n × n doubly stochastic matrices, and ω n denote the convex polytope of all n × n doubly substochastic matrices. For a matrix A ∈ ω n , define the sub-defect of A to be the smallest integer k such that there exists an (n + k) × (n + k) doubly stochastic matrix containing A as a submatrix. Let ω n,k denote the subset of ωn which contains all doubly substochastic matrices with sub-defect k. For π a permutation of symmetric group of degree n, the sequence of elements a 1π(1) , a 2π(2) , …, a nπ(n) is called the diagonal of A corresponding to π. Let h(A) and l(A) denote the maximum and minimum diagonal sums of A ∈ ω n,k , respectively. In this paper, existing results of h and l functions are extended from Ω n to ω n,k . In addition, an analogue of Sylvesters law of the h function on ω n,k is proved.

Cite

CITATION STYLE

APA

Cao, L., Chen, Z., Duan, X., Koyuncu, S., & Li, H. (2019). Diagonal sums of doubly substochastic matrices. Electronic Journal of Linear Algebra, 35(1), 42–52. https://doi.org/10.13001/1081-3810.3760

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free