BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-73-354
       ENTRY:: September 25, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The number of SDR's in certain regular systems.
        TYPE:: Technical Report
      AUTHOR:: Klarner, David A.
        DATE:: April 1973
       PAGES:: 8
    ABSTRACT:: Let ($a_1$,...,$a_k$) = $\bar{a}$ denote a vector of numbers,
               and let C($\bar{a}$,n) denote the n $\times$ n cyclic matrix
               having ($a_1$,...,$a_k$,0,...,0) as its first row. It is
               shown that the sequences (det C($\bar{a}$,n): n = k,k+1,...)
               and (per C($\bar{a}$,n): n = k,k+1,...) satisfy linear
               homogeneous difference equations with constant coefficients.
               The permanent, per C, of a matrix C is defined like the
               determinant except that one forgets about ${(-1)}^{sign \pi}$
               where $\pi$ is a permutation.
       NOTES:: [Adminitrivia V1/Prg/19950925]
         END:: STAN//CS-TR-73-354