๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Inequalities for permanents involving Perron complements

โœ Scribed by Ravindra Bapat; Michael Neumann


Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
189 KB
Volume
385
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis


Let A โˆˆ R n,n and let ฮฑ and ฮฒ be nonempty complementary subsets of {1, . . . , n} of increasing integers. For ฮป > ฯ(A[ฮฒ]), we define the generalized Perron complement of A[ฮฒ] in A at ฮป as the matrix

For the classes of the nonnegative matrices and of the positive semidefinite matrices, we study the relationship between the permanents of the whole matrices and the permanents of their Perron complement. Our conditions, which hold in many cases of interest, are such that the value of the permanent increases as we pass from the whole matrix to its generalized Perron complement.

For nonnegative and irreducible matrices, we also study the relationship between the maximum circuit geometric mean of the entire matrix and the maximum circuit geometric mean of its Perron complements.


๐Ÿ“œ SIMILAR VOLUMES


Inequalities for permanents of hermitian
โœ Dmitry Falikman ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 311 KB

For given integers n i, n 2 ~ 1, we consider two hermitian matrices of order n --n 1 +ng., written in block form: where every matrix X~j has dimension n, X nj, 1 < i, j < 2. It is proved that if A u > B u > 0, Az~ > B~ > 0, then per A > per B > 0.

Some inequalities for Schur complements
โœ Jianzhou Liu; Jian Wang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 93 KB

We shall obtain some inequalities for Schur complements of products and sums of matrices.

Inequalities for the gamma function with
โœ Peter J. Grabner; Robert F. Tichy; Uwe T. Zimmermann ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 548 KB

The best known upper bound on the permanent of a O-l matrix relies on the knowledge of the number of nonzero entries per row. In certain applications only the total number of nonzero entries is known. In order to derive bounds in this situation we prove that the function f:( -1, co) + l%, defined by