|
|||||
|
|
The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two |
|
| Authors: | Thomas H. Pate |
| Affiliation: | a Mathematics Department Auburn University Auburn AL 36849 USA. |
| Abstract: | If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible. |
| Keywords: | Permanent Correlation Matrix Inequality Generalized Matrix Function |
| 本文献已被 InformaWorld 等数据库收录！ | |