Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...
