An Inequality of Hadamard Type for Permanents

Details An Inequality of Hadamard Type for Permanents An Inequality of Hadamard Type for Permanents

2005-08-04

arxiv.org/abs/math/0508096v1

Methods and Applications of Analysis, vol 13, No. 1, pp 1-18 (March 2006)

Mathematics

Classical Analysis and ODEs

17 pages, latex

Scientific paper

Let 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.

Affiliated with

Also associated with

No associations

Rating

An Inequality of Hadamard Type for Permanents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Inequality of Hadamard Type for Permanents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Inequality of Hadamard Type for Permanents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-614805