32 research outputs found
An inequality for permanent of (0, 1)-matrices
AbstractLet A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i=1, …, n, and let per (A) denote the permanent of A. Then per(A)≤∏i=1nri+21+2 where equality can occur if and only if there exist permutation matrices P and Q such that PAQ is a direct sum of 1-square and 2-square matrices all of whose entries are 1
Permanents
This 1978 book gives an account of the theory of permanents, their history and applications
On a conjecture of R.F. Scott (1881)
AbstractA formula is given for the permanent of a general Cauchy matrix ((xi−yj)−1). In a special case, where the xi and the yj are the distinct nth roots of 1 and −1 respectively, a formula for the permanent, conjectured by R. F. Scott, is proved by computing the eigenvalues of related circulants