Extending the Minc-Brègman upper bound for the permanent

Linear and Multilinear Algebra

Volumn 47, Issue 1, 2000, Pages 77-91

  Soules, George W ^a  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

Author keywords

Nonnegative matrix; Permanent; Recursion; Upper bound

Indexed keywords

EID: 0142161587     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Baum, L. E., Petrie, T., Soules, G. W. and Weiss, N. (1970). A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat., 41, 164-171.
2. Brègman, L. M. (1973). Some properties of nonnegative matrices and their permanents. Soviet Math. Dokl., 14(4), 945-949.
3. Cheon, G. (1995). Upper bounds for subpermanents of nonnegative matrices. Commun. Korean Math. Soc., 1(10), 27-34.
4. Dempster, A. P., Laird, N. M. and Rubin, D. B. (1977). Maximum-likelihood from incomplete data via the EM algorithm. J. Royal. Statist. Soc. Ser. B (methodological), 39, 1-38.
5. Hwang, S., Kräuter, A. R. and Michael, T. S. (1998). An upper bound for the permanent of a nonnegative matrix. Linear Algebra Appl., 281, 259-263.
6. Mine, H. (1963). Upper bounds for permanents of (0,1)-matrices. Bull. Amer. Math. Soc., 69, 789-791.
7. Schrijver, A. (1978). A short proof of Mine's conjecture. J. Combin. Theory, Series A, 25, 80-83.
8. Soules, G. W. (1991). The rate of convergence of Sinkhorn balancing. Linear Algebra Appl., 150, 3-40.