Lower bounds for permanents of Gram matrices having a rank one principal submatrix (Q1111652)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower bounds for permanents of Gram matrices having a rank one principal submatrix
scientific article

    Statements

    Lower bounds for permanents of Gram matrices having a rank one principal submatrix (English)
    0 references
    0 references
    1988
    0 references
    The author presents the following: Let \(A=[a_{ij}]\) be a positive semidefinite Hermitian \((n+p)\times (n+p)\) matrix partitioned into blocks \(A_{11}\), \(A_{12}\), \(A_{21}\), and \(A_{22}\) such that \(A_{11}\) is \(n\times n\) and \(A_{22}\) is \(p\times p\). Let \(\tilde A\) denote the \((n+p-1)\times (n+p-1)\) matrix get from A by deleting the first row and column of A. If \(A_{11}\) is of rank one, then \(per(A)\geq na_{11}per(\tilde A)\) with equality iff \(A_{12}\) is the zero matrix or A has a row of zeros. Some examples in this regard are added.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bounds
    0 references
    permanents
    0 references
    Gram matrices
    0 references
    rank one principal submatrix
    0 references
    positive semidefinite Hermitian
    0 references
    0 references