AbstractLet P1,…,Pm be n×n permutation matrices. In this note, we give a simple necessary condition for all convex combinations of P1,…,Pm to be orthostochastic. We show that for n⩽15 the condition is also sufficient, but for n⩾15 whether the condition is sufficient or not is still open
In this article we formulate an optimization problem of minimizing the distance from the uniform van...
AbstractIt has been conjectured that if A is a doubly stochastic n>× n matrix such that per A(i, j)≥...
AbstractWe investigate the extreme points, faces and their dimensions of the convex polytope of doub...
AbstractLet P1,…,Pm be n×n permutation matrices. In this note, we give a simple necessary condition ...
AbstractLet U3 be the set of all 3 × 3 unitary matrices, and let A and B be two 3 × 3 complex norḿal...
AbstractWe consider the set of n×n matrices X=(xij) for which ∑iϵI∑jϵJxij ⩾ |I|+|J|−n, for all I,J⊆ ...
AbstractNecessary and sufficient conditions are given for a doubly stochastic matrix D to be express...
AbstractIn this paper, we show that a problem of finding a permuted version of k vectors from RN suc...
International audienceBirkhoff-von Neumann (BvN) decomposition of doubly stochastic matrices express...
Let E[lowered n] be the set of all nxn doubly stochastic positive semidefinite matrices. Then E[lowe...
Let T be the set of n×n (sub)permutation matrices, doubly (sub)stochastic matrices, or the set of m×...
AbstractLet S be the set of n×n (sub)permutation matrices, doubly (sub)stochastic matrices, or the s...
AbstractEach extreme point in the convex set Δ∗n of all n×n symmetric doubly-stochastic matrices is ...
AbstractMirsky (1963) raised the question of characterizing Ω0n, the convex hull of the nonidentity ...
The Bruhat order is defined in terms of an interchange operation on the set of permutation matrices ...
In this article we formulate an optimization problem of minimizing the distance from the uniform van...
AbstractIt has been conjectured that if A is a doubly stochastic n>× n matrix such that per A(i, j)≥...
AbstractWe investigate the extreme points, faces and their dimensions of the convex polytope of doub...
AbstractLet P1,…,Pm be n×n permutation matrices. In this note, we give a simple necessary condition ...
AbstractLet U3 be the set of all 3 × 3 unitary matrices, and let A and B be two 3 × 3 complex norḿal...
AbstractWe consider the set of n×n matrices X=(xij) for which ∑iϵI∑jϵJxij ⩾ |I|+|J|−n, for all I,J⊆ ...
AbstractNecessary and sufficient conditions are given for a doubly stochastic matrix D to be express...
AbstractIn this paper, we show that a problem of finding a permuted version of k vectors from RN suc...
International audienceBirkhoff-von Neumann (BvN) decomposition of doubly stochastic matrices express...
Let E[lowered n] be the set of all nxn doubly stochastic positive semidefinite matrices. Then E[lowe...
Let T be the set of n×n (sub)permutation matrices, doubly (sub)stochastic matrices, or the set of m×...
AbstractLet S be the set of n×n (sub)permutation matrices, doubly (sub)stochastic matrices, or the s...
AbstractEach extreme point in the convex set Δ∗n of all n×n symmetric doubly-stochastic matrices is ...
AbstractMirsky (1963) raised the question of characterizing Ω0n, the convex hull of the nonidentity ...
The Bruhat order is defined in terms of an interchange operation on the set of permutation matrices ...
In this article we formulate an optimization problem of minimizing the distance from the uniform van...
AbstractIt has been conjectured that if A is a doubly stochastic n>× n matrix such that per A(i, j)≥...
AbstractWe investigate the extreme points, faces and their dimensions of the convex polytope of doub...
DOI
Add to ORKG