A minimal completion of doubly substochastic matrix

DOI10.1080/03081087.2016.1155531zbMath1358.15025OpenAlexW2294318661MaRDI QIDQ2953189

Timmothy Parmer, Lei Cao, Selcuk Koyuncu

Publication date: 3 January 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1155531

zbMATH Keywords

doubly stochastic matrixpermutation matricesBirkhoff's theoremdoubly substochastic matrixminimal completion

Mathematics Subject Classification ID

Stochastic matrices (15B51) Matrix completion problems (15A83)

Related Items (12)

Partial Permutation and Alternating Sign Matrix Polytopes ⋮ On the maximum of the permanent of \((I - A)\) ⋮ A short note on extreme points of certain polytopes ⋮ Minimal completion of I × I doubly substochastic matrices ⋮ Unnamed Item ⋮ The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices ⋮ Partitions of the polytope of doubly substochastic matrices ⋮ Diagonal Sums of Doubly Substochastic Matrices ⋮ Sub-defect of product of doubly substochastic matrices ⋮ A minimal completion of (0, 1)-matrices without total support ⋮ Permanents of doubly substochastic matrices ⋮ Increasable doubly substochastic matrices with application to infinite linear equations

Cites Work

• Unnamed Item
• On a convex set of matrices
• On Representatives of Subsets

This page was built for publication: A minimal completion of doubly substochastic matrix