Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices

Linear Algebra and Its Applications

Volumn 430, Issue 4, 2009, Pages 1364-1374

  Schwartz, Moshe ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Banded Toeplitz matrix; Hafnian; Permanent; Toeplitz matrix

Indexed keywords

BANDED TOEPLITZ MATRIX; HAFNIAN; NEW EFFICIENT METHODS; PERMANENT; TOEPLITZ MATRIX;

EID: 58049195555     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2008.10.029     Document Type: Article

References (23)

1. Böttcher A., and Grudsky S.M. Toeplitz Matrices, Asymptotic Linear Algebra, and Functional Analysis (2000), Birkhäuser
2. Brualdi R.A., and Ryser H.J. Combinatorial Matrix Theory (1991), Cambridge University Press
3. Brualdi R.A., and Shader B.L. Matrices of Sign-Solvable Linear Systems (1995), Cambridge University Press
4. Codenotti B., Crespi V., and Resta G. On the permanent of certain (0, 1) Toeplitz matrices. Linear Algebra Appl. 267 (1997) 65-100
5. Deza M., and Huang H. Metrics on permutations, a survey. J. Combin. Inform. System Sci. 23 (1998) 173-185
6. Gray R.M. On the asymptotic eigenvalue distribution of Toeplitz matrices. IEEE Trans. Inform. Theory 18 (1972) 725-730
7. Kasteleyn P.W. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica 27 (1961) 1209-1225
8. Kasteleyn P.W. Graph theory and crystal physics. In: Harary F. (Ed). Graph Theory and Theoretical Physics (1967), Academic Press 43-110
9. King B.W., and Parker F.D. A Fibonacci matrix and the permanent function. Fibonacci Quart. 7 (1969) 539-544
10. Kuperberg G. An exploration of the permanent-determinant method. Electron. J. Combin. 5 (1998)
11. Lagrange R. Quelques résultats dans la métrique des permutations. Ann. Sci. Ecole Norm. Sup. 79 (1962)
12. T.-T. Lin, S.-C. Tsai, W.-G. Tzeng, Efficient encoding and decoding with permutation arrays, in: Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT2008), Toronto, Canada, 2008, pp. 211-214.
13. Metropolis N., Stein M.L., and Stein P.R. Permanents of cyclic (0, 1) matrices. J. Combin. Theory Ser. B 7 (1969) 291-321
14. Minc H. Permanents. Encyclopedia of Mathematics and its Applications vol. 6 (1978), Cambridge University Press
15. Minc H. Recurrence formulas for permanents of (0, 1) circulants. Linear Algebra Appl. 71 (1985) 241-265
16. Minc H. Permanental compounds and permanents of (0, 1) circulants. Linear Algebra Appl. 86 (1987) 11-42
17. Minc H. Nonnegative Matrices (1988), Wiley, New York
18. Ryser H.J. Combinatorial mathematics. Carus Mathematical Monograph vol. 14 (1963), Mathematical Association of America
19. Schwartz M., and Bruck J. Constrained codes as networks of relations. IEEE Trans. Inform. Theory 54 5 (2008) 2179-2195
20. Temperley H.N.V., and Fisher M.E. Dimer problem in statistical mechanics - an exact result. Philos. Mag. 6 (1960) 1061-1063
21. L.G. Valiant, Completeness classes in algebra, in: ACM Symposium on the Theory of Comput., 1979, pp. 249-261.
22. Valiant L.G. The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979) 189-201
23. L.G. Valiant, Holographic algorithms, in: Proceedings of the 45th Annual IEEE Symposium on the Foundations of Computer Science (FOCS2004), 2004, pp. 306-315.