Year: 2018
Type: preprint
Abstract: Let B be an n by n doubly substochastic matrix. We show that B can be written as a convex combination of no more than σ(B)+t subpermutation matrices, where σ(B) is the number of nonzero elements in B and t is the number of fully indecomposable components of B^{comp}, the minimal doubly stochastic completion of B obtained by a specific way.
Source: arXiv (Cornell University)
Author: Cao, Lei
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2782357305