Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T11:09:40.308Z 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, Ontario N2L 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 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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1977