论文信息 - An upper bound for the permanent of a fully indecomposable matrix

An upper bound for the permanent of a fully indecomposable matrix

Let A be an n x n fully indecomposable matrix with nonnegative integer entries and let o(A) denote the sum of the entries of A. We prove that per (A) < 2o(A)-2n + 1 and give necessary and sufficient conditions for equality to hold.

T. Foregger

[1] Henryk Minc,et al. Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices , 1963 .

[2] H. Ryser,et al. Matrix factorizations of determinants and permanents , 1966 .

[3] On a conjecture of ryser and minc , 1970 .

[4] The fully indecomposable matrix and its associated bipartite graph - An investigation of combinatorial and structural properties , 1970 .