AbstractA short proof is given of the following conjecture of Minc, proved in 1973 by Brègman. Let A be a n × n − (0, 1)-matrix with ri ones in row i. Then per A ⩽ πi=1nri!1ri
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractLet A be a fully indecomposable, nonnegative matrix of order n with row sums rl,rn, and let ...
AbstractLet A be a permanent minimizing doubly stochastic matrix. This paper discusses the maximum n...
AbstractA short proof is given of the following conjecture of Minc, proved in 1973 by Brègman. Let A...
AbstractLet UR(α, β) denote the class of all square matrices with each entry equal to one of the non...
AbstractLet A be a fully indecomposable n×n matrix with nonnegative integer entries. Then the perman...
AbstractBrualdi's conjecture on the minimum permanent in the set of doubly stochastic n × n matrices...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
AbstractWe show that for A ranging over n×n circulants with three ones in each row, where n is prime...
AbstractLet A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i=1, …, n, and let ...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractLet Kn denote the convex set consisting of all real nonnegative n×n matrices whose entries h...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractLet A be a fully indecomposable, nonnegative matrix of order n with row sums rl,rn, and let ...
AbstractLet A be a permanent minimizing doubly stochastic matrix. This paper discusses the maximum n...
AbstractA short proof is given of the following conjecture of Minc, proved in 1973 by Brègman. Let A...
AbstractLet UR(α, β) denote the class of all square matrices with each entry equal to one of the non...
AbstractLet A be a fully indecomposable n×n matrix with nonnegative integer entries. Then the perman...
AbstractBrualdi's conjecture on the minimum permanent in the set of doubly stochastic n × n matrices...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
AbstractWe show that for A ranging over n×n circulants with three ones in each row, where n is prime...
AbstractLet A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i=1, …, n, and let ...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractLet Kn denote the convex set consisting of all real nonnegative n×n matrices whose entries h...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractLet A be a fully indecomposable, nonnegative matrix of order n with row sums rl,rn, and let ...
AbstractLet A be a permanent minimizing doubly stochastic matrix. This paper discusses the maximum n...
DOI
Add to ORKG