Permutation matrices whose convex combinations are orthostochastic (Q757545): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q171542 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Yiu-Tung Poon / rank | |||
Normal rank |
Revision as of 05:56, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Permutation matrices whose convex combinations are orthostochastic |
scientific article |
Statements
Permutation matrices whose convex combinations are orthostochastic (English)
0 references
1991
0 references
An \(n\times n\) doubly stochastic matrix \((a_{ij})\) is said to be orthostochastic if there exists an \(n\times n\) unitary matrix \((u_{ij})\) such that \(a_{ij}=| u_{ij}|^ 2\). Let \(P_ 1,...,P_ m\) be \(n\times n\) permutation matrices. The authors give a simple necessary condition for all convex combinations of \(P_ 1,...,P_ m\) to be orthostochastic. Then they show that the condition is also sufficient when \(n\leq 15\) but leave the problem open for \(n>15\). For a given prime number p, let \({\mathcal G}\) be a group of \(n\times n\) permutation matrices such that \(M^ p=I\) for every \(M\in {\mathcal G}\). The authors give some results on the structure of \({\mathcal G}\).
0 references
orthostochastic matrix
0 references
matrix group
0 references
doubly stochastic matrix
0 references
permutation matrices
0 references
convex combinations
0 references