English

Convex Set of Doubly Substochastic Matrices

Combinatorics 2017-11-21 v1

Abstract

Denote A\mathcal{A} as the set of all doubly substochastic m×nm \times n matrices and let kk be a positive integer. Let Ak\mathcal{A}_k be the set of all 1/k1/k-bounded doubly substochastic m×nm \times n matrices, i.e., Ak{EA:ei,j[0,1/k],i=1,2,,m,j=1,2,,n}\mathcal{A}_k \triangleq \{E \in \mathcal{A}: e_{i,j} \in [0, 1/k], \forall i=1,2,\cdots,m, j = 1,2,\cdots, n\}. Denote Bk\mathcal{B}_k as the set of all matrices in Ak\mathcal{A}_k whose entries are either 00 or 1/k1/k. We prove that Ak\mathcal{A}_k is the convex hull of all matrices in Bk\mathcal{B}_k.

Keywords

Cite

@article{arxiv.1711.06818,
  title  = {Convex Set of Doubly Substochastic Matrices},
  author = {Lei Deng and Qiulin Lin},
  journal= {arXiv preprint arXiv:1711.06818},
  year   = {2017}
}

Comments

6 pages, under submission

R2 v1 2026-06-22T22:50:11.633Z