On the number of different permanents of some sparse (0,1)-circulant matrices
โ Scribed by Giovanni Resta; Giovanni Sburlati
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 235 KB
- Volume
- 375
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
Starting 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 โข 3 h . 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 n k-2 /k! + O(n k-3 ).
๐ SIMILAR VOLUMES
This paper gives a reduced formula for the precise number of matrices in 9.1(R, S), the class of matrices of zeros and ones with row and column sum vectors R and S, respectively. With the new formula, the computing time is greatly shortened.
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We investigate structural properties of circulant matrices, showing that (i) if they are dense enough, then they contain large arbitrary submatrices, and (ii) if they are very sparse, then they are not too `