The asymptotic number of (0,1)-matrices with zero permanent
โ Scribed by C.J. Everett; P.R. Stein
- Book ID
- 107748141
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 383 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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 [2] we investigated the spectrum of a random gl,tph (symmetric matrix). In the present paper we are going to show that the results of [2] carry over to non-symmetric random (Q, 1) matrices (directed graphs), namely the largest eigenvalue is of order n, while the other eigenvalues xre of order n 1