Circulant recursive matrices
Recursive matrices are bi-infinite matrices which can be recursively generated starting from two given Laurent series α and β, called the recurrence rule and the boundary value of the matrix, respectively. The i th row of a recursive matrix contains the coefficients of the series α i β. These matrices were introduced by Barnabei, Brini, and Nicoletti  to formulate a more general version of the umbral calculus developed in a series of fundamental papers by Rota and his school [7, 8, 9]. In  it was shown that the most important operators of the umbral calculus can be represented by recursive matrices. In particular, shift-invariant operators, which play a crucial role in Rota’s theory, correspond to Toeplitz matrices, which can be characterized as recursive matrices with recurrence rule α(t) = t. Recently, recursive matrices were found to be useful in studying algebraic aspects of signal processing, since they contain the classes of bi-infinite Toeplitz, Hankel and Hurwitz matrices as special cases [3, 4].
KeywordsComplex Polynomial Toeplitz Matrice Quotient Ring Circulant Matrix Circulant Matrice
Unable to display preview. Download preview PDF.
- Barnabei, M., Brini, A., Nicoletti, G. (1986): A general umbral calculus. In: Science and computers. Advances in Math. Suppl. Studies, 10. Academic Press, Orlando, FL, pp. 221–244Google Scholar
- Davis, P.J. (1994): Circulant matrices. 2nd edition. Chelsea, New YorkGoogle Scholar
- Gantmacher, F.R. (1959): The theory of matrices, vols. 1, 2. Chelsea, New YorkGoogle Scholar
- Mullin, R., Rota, G.-C. (1970): On the foundations of combinatorial theory. III. Theory of binomial enumeration. In: Harris, B. (ed.), Graph theory and its applications. Academic Press, New York pp. 167–213Google Scholar