AbstractStarting from known results about the number of possible values for the permanents of (0,1)-circulant matrices with three nonzero entries per row, and whose dimension n is prime, we prove corresponding results for n power of a prime, n product of two distinct primes, and n=2·3h. Supported by some experimental results, we also conjecture that the number of different permanents of n×n (0,1)-circulant matrices with k nonzero per row is asymptotically equal to nk−2/k!+O(nk−3)
AbstractWe show that for A ranging over n×n circulants with three ones in each row, where n is prime...
AbstractIt is shown that Zn/n·2n2 - n + 1→1, where Zn is the number of n × n (0,1)-matrices with zer...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...
AbstractStarting from known results about the number of possible values for the permanents of (0,1)-...
Starting from known results about the number of possible values for the permanents of $(0,1)$-circul...
AbstractStarting from previous works concerning permanents of (0,1)-circulant matrices with three no...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
AbstractStarting from previous results concerning determinants and permanents of (0,1) circulant mat...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
AbstractIt was shown by the author in a recent paper that a recurrence relation for permanents of (0...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractIn this paper a particular partition on blocks of generalized circulant (0,1) matrices of co...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
AbstractWe show that for A ranging over n×n circulants with three ones in each row, where n is prime...
AbstractIt is shown that Zn/n·2n2 - n + 1→1, where Zn is the number of n × n (0,1)-matrices with zer...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...
AbstractStarting from known results about the number of possible values for the permanents of (0,1)-...
Starting from known results about the number of possible values for the permanents of $(0,1)$-circul...
AbstractStarting from previous works concerning permanents of (0,1)-circulant matrices with three no...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
AbstractStarting from previous results concerning determinants and permanents of (0,1) circulant mat...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
AbstractIt was shown by the author in a recent paper that a recurrence relation for permanents of (0...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractIn this paper a particular partition on blocks of generalized circulant (0,1) matrices of co...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
AbstractWe show that for A ranging over n×n circulants with three ones in each row, where n is prime...
AbstractIt is shown that Zn/n·2n2 - n + 1→1, where Zn is the number of n × n (0,1)-matrices with zer...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...