Conversion of the permanent into the determinant
Conversion of the permanent into the determinant
复制标题
常式转换为行列式
DOI:
10.1090/s0002-9939-1971-0279110-x
复制
发表时间:
1971
期刊:
影响因子:
--
通讯作者:
P. Gibson
中科院分区:
文献类型:
--
作者:
P. Gibson
Let A be an n-square (0, 1)-matrix with positive permanent. It is shown that if the permanent of A can be converted into a determinant by affixing ? signs to the elements of A then A has at most (n2+3n-2)/2 positive entries. Corollaries of this result are given. The permanent appears naturally in many combinatorial problems. Since computations with the permanent are difficult, it is of interest to find a simple method for conversion of the permanent into the determinant. Polya [4] noted that there is no method of uniformly affixing ? signs to the elements of the matrices of the vector space Mn, n>2, of all n-square matrices over the field F of characteristic zero so that the permanent is converted into the determinant. Marcus and Minc [2] generalized this by showing that if n>2 then there is no linear transformation c: MnMn such that per A = det a(A) for every A in M.. In this paper, a different improvement of Polya's result is given. It is shown that if A is an n-square (0, 1)matrix with positive permanent and there is a way of converting the permanent of A into a determinant by affixing ? signs to the elements of A then A has at most (n2+3n 2)/2 positive entries. Let A = [aij] be an n-square matrix. Let A i; be the (n 1)-square submatrix of A that remains after row i and column j are removed, and let sii denote the sum of the entries in the complement of Aij, i.e.,