An Inequality of Hadamard Type for Permanents

  • Carlen E
  • Lieb E
  • Loss M
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Let F be an N ×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)| ≤ É N j=1 | f j |. Here we prove a sharp upper bound on the permanent of F , which is |perm(F)| ≤ N ! N N/2 N j=1 | f j |, and we determine all of the cases of equality. We also discuss the case in which | f j | is replaced by the ℓp norm of the vector f considered as a function on {1, 2,. .. , N }. We note a simple sharp inequality for p = 1, and obtain bounds for intermediate p by interpolation.

Cite

CITATION STYLE

APA

Carlen, E., Lieb, E. H., & Loss, M. (2006). An Inequality of Hadamard Type for Permanents. Methods and Applications of Analysis, 13(1), 1–18. https://doi.org/10.4310/maa.2006.v13.n1.a1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free