An upper bound for the permanent of a fully indecomposable matrix
HTML articles powered by AMS MathViewer
- by Thomas H. Foregger PDF
- Proc. Amer. Math. Soc. 49 (1975), 319-324 Request permission
Abstract:
Let $A$ be an $n \times n$ fully indecompasable matrix with nonnegative integer entries and let $\sigma (A)$ denote the sum of the entries of $A$. We prove that ${\text {per}}(A) \leq {2^{\sigma (A) - 2n}} + 1$ and give necessary and sufficient conditions for equality to hold.References
- Henryk Minc, Upper bounds for permanents of $(0,\,1)$-matrices, Bull. Amer. Math. Soc. 69 (1963), 789–791. MR 155843, DOI 10.1090/S0002-9904-1963-11031-9
- Henryk Minc, An inequality for permanents of $(0,\,1)-matrices.$, J. Combinatorial Theory 2 (1967), 321–326. MR 211890
- W. B. Jurkat and H. J. Ryser, Matrix factorizations of determinants and permanents, J. Algebra 3 (1966), 1–27. MR 195879, DOI 10.1016/0021-8693(66)90016-0
- Albert Nijenhuis and Herbert S. Wilf, On a conjecture of Ryser and Minc, Nederl. Akad. Wetensch. Proc. Ser. A 73 = Indag. Math. 32 (1970), 151–157. MR 0269671 Edwin J. Roberts, The fully indecomposable matrix and its associated bi-partite graph-an investigation of combinatorial and structural properties, NASA Technical Memorandum TMX-58037, January 1970.
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 49 (1975), 319-324
- MSC: Primary 15A15
- DOI: https://doi.org/10.1090/S0002-9939-1975-0369385-4
- MathSciNet review: 0369385