AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using an unbiased estimator of permanent [Random Structures Algorithms 5 (1994) 349]. It is a refinement of Minc’s very famous result, and apparently tighter than the current best general bound in some cases
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractFor given integers n1, n2 ≥ 1, we consider two hermitian matrices of order n = n1 + n2, writ...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractWe investigate an old suggestion of A.E. Brouwer we call decomposition, for constructing a c...
AbstractLet A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i=1, …, n, and let ...
AbstractWe survey the most recent results on permanental bounds of a nonnegative matrix. Some older ...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractLet A be a nonnegative integral n-square matrix with row sums r1, …, rn. It is known that pe...
AbstractIn this paper we investigate the values of permanents according to the positions of zeros ov...
AbstractWe show that the permanent of an n×n matrix with iid Bernoulli entries ±1 is of magnitude n(...
Applying finite-differences to a generating function produces formulas for the permanent of a matrix...
Applying finite-differences to a generating function produces formulas for the permanent of a matrix...
AbstractLet UR(α, β) denote the class of all square matrices with each entry equal to one of the non...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractFor given integers n1, n2 ≥ 1, we consider two hermitian matrices of order n = n1 + n2, writ...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractWe investigate an old suggestion of A.E. Brouwer we call decomposition, for constructing a c...
AbstractLet A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i=1, …, n, and let ...
AbstractWe survey the most recent results on permanental bounds of a nonnegative matrix. Some older ...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractLet A be a nonnegative integral n-square matrix with row sums r1, …, rn. It is known that pe...
AbstractIn this paper we investigate the values of permanents according to the positions of zeros ov...
AbstractWe show that the permanent of an n×n matrix with iid Bernoulli entries ±1 is of magnitude n(...
Applying finite-differences to a generating function produces formulas for the permanent of a matrix...
Applying finite-differences to a generating function produces formulas for the permanent of a matrix...
AbstractLet UR(α, β) denote the class of all square matrices with each entry equal to one of the non...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractFor given integers n1, n2 ≥ 1, we consider two hermitian matrices of order n = n1 + n2, writ...
DOI
Add to ORKG