A lower bound on the permanent of a $(0, 1)$-matrix
HTML articles powered by AMS MathViewer
- by D. J. Hartfiel PDF
- Proc. Amer. Math. Soc. 39 (1973), 83-85 Request permission
Abstract:
The paper gives a lower bound for the permanent of a fully indecomposable $(0,1)$-matrix with at least $k$ ones in each row. The result extends those of H. Minc and P. Gibson.References
- P. M. Gibson, A lower bound for the permanent of a $(0,\,1)$-matrix, Proc. Amer. Math. Soc. 33 (1972), 245–246. MR 294360, DOI 10.1090/S0002-9939-1972-0294360-5
- D. J. Hartfiel, A simplified form for nearly reducible and nearly decomposable matrices, Proc. Amer. Math. Soc. 24 (1970), 388–393. MR 252415, DOI 10.1090/S0002-9939-1970-0252415-3
- Henryk Minc, On lower bounds for permanents of $(0,\,1)$ matrices, Proc. Amer. Math. Soc. 22 (1969), 117–123. MR 245585, DOI 10.1090/S0002-9939-1969-0245585-6
- Henryk Minc, Nearly decomposable matrices, Linear Algebra Appl. 5 (1972), 181–187. MR 313277, DOI 10.1016/0024-3795(72)90027-4
- Richard Sinkhorn, Concerning a conjecture of Marshall Hall, Proc. Amer. Math. Soc. 21 (1969), 197–201. MR 241440, DOI 10.1090/S0002-9939-1969-0241440-6
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 39 (1973), 83-85
- MSC: Primary 15A15
- DOI: https://doi.org/10.1090/S0002-9939-1973-0313265-5
- MathSciNet review: 0313265