An Inequality of Hadamard Type for Permanents

dc.creatorCarlen, Eric
dc.creatorLieb, Elliott H.
dc.creatorLoss, Michael
dc.date2005-08-04
dc.date.accessioned2026-07-07T06:36:05Z
dc.date.available2026-07-07T06:36:05Z
dc.descriptionLet F be an N x N complex matrix whose jth column is the vector f_j in C^N. Let |f_j|^2 denote the sum of the absolute squares of the entries of f_j. Hadamard's inequality for determinants states that |\det(F)| <= \prod_{j=1}^N|f_j|. Here we prove a sharp upper bound on the permanent of F, which is |perm(F)| <= N!N^{-N/2} \prod_{j=1}^N|f_j|, and we determine all of the cases of equality.
dc.description17 pages, latex
dc.identifierhttps://arxiv.org/abs/math/0508096
dc.identifierhttp://arxiv.org/abs/math/0508096
dc.identifierMethods and Applications of Analysis, vol 13, No. 1, pp 1-18 (March 2006)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99978
dc.subjectClassical Analysis and ODEs
dc.subjectFunctional Analysis
dc.subjectOperator Algebras
dc.subject15A15; 26D20
dc.titleAn Inequality of Hadamard Type for Permanents
dc.typetext

Files

Collections