Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-27T20:59:47.783Z Has data issue: false hasContentIssue false

An Algorithm for the Permanent of Circulant Matrices

Published online by Cambridge University Press:  20 November 2018

Larry J. Cummings
Affiliation:
Faculty of Mathematics University of Waterloo Waterloo, OntarioN2L 3G1
Jennifer Seberry Wallis
Affiliation:
Institute of Advanced Studies Australian National University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The permanent of an nn matrix A = (aij) is the matrix function

1

where the summation is over all permutations in the symmetric group, Sn. An nn matrix A is a circulant if there are scalars a1 …, an such that

2

where P is the nn permutation matrix corresponding to the cycle (12 … n) in Sn.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1977

References

1. Brualdi, R. and Newman, M., An Enumeration problem for a congruence equation, Journal of Research, (U.S.) National Bureau of Standards 74B (1970), 37-40.Google Scholar
2. Marucs, M. and Minc, H., A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Inc., Boston, 1964.Google Scholar
3. Metropolis, N., Stein, M. L., and Stein, P. R., Permanents of cyclic (0,1) matrices, J. Combinatorial Theory 7 (1969), 291-321.Google Scholar
4. Mine, H., Permanents of (0, 1) circulants, Canad. Math. Bull. 7 (1964), 253-263.Google Scholar
5. Mine, H., On permanents of circulants, Pacific J. Math. 42 (1972), 477-484.Google Scholar
6. Ryser, H. J., Combinatorial Mathematics, MAA Carus Monograph 14, 1963.Google Scholar
7. Tinsley, M. F., Permanents of cyclic matrices, Pacific J. Math. 10 (1960), 1067-1082.Google Scholar