Article contents
An Algorithm for the Permanent of Circulant Matrices
Published online by Cambridge University Press: 20 November 2018
Extract
The permanent of an n ✕ n matrix A = (aij) is the matrix function
1
where the summation is over all permutations in the symmetric group, Sn. An n ✕ n matrix A is a circulant if there are scalars a1 …, an such that
2
where P is the n ✕ n permutation matrix corresponding to the cycle (12 … n) in Sn.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1977
References
- 4
- Cited by