Lower bounds for permanents of Gram matrices having a rank one principal submatrix (Q1111652): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90063-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985036569 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Hadamard Theorem for Permanents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5520710 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Norm of symmetric product compared with norm of tensor product / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality involving permanents of certain direct products / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:51, 19 June 2024
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
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
lower bounds
0 references
permanents
0 references
Gram matrices
0 references
rank one principal submatrix
0 references
positive semidefinite Hermitian
0 references