An Upper Bound for the Permanent of a Fully Indecomposable Matrix

DOI10.2307/2040639zbMath0274.15007OpenAlexW4249841687MaRDI QIDQ5181474

Thomas H. Foregger

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2040639

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (5)

Handle bases and bounds on the number of subgraphs ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ New permanental bounds for Ferrers matrices ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I

Cites Work

• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• Matrix factorizations of determinants and permanents
• Unnamed Item

This page was built for publication: An Upper Bound for the Permanent of a Fully Indecomposable Matrix