Some upper bounds for permanents of (0, 1)-matrices

Abstract

In this paper, some upper bounds for computing the permanent of (0, 1) -matrices are given based on row sum and column index sets of each row. These bounds are shown to be better than those obtained by Minc-Bregman in terms of row sums. Finding permanent of a matrix is useful in several applications such as in combinatorics, graph theory and statistics and probability. However, computing permanent of a matrix is difficult and therefore having their upper bounds will be useful.

Keywords:

• Permanent
• row sum
• (0,1) -matrix
• upper bound