Abstract
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 [1] to formulate a more general version of the umbral calculus developed in a series of fundamental papers by Rota and his school [7–9]. In [2] 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].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnabei, M., Brini, A., Nicoletti, G. (1982): Recursive matrices and umbral calculus. J. Algebra 75, 546–573
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–244
Barnabei, M., Guerrini, C., Montefusco, L.B. (1998): Some algebraic aspects of signal processing. Linear Alg. Appl. 284, 3–17
Barnabei, M., Montefusco, L.B. (1998): Recursive properties of Toeplitz and Hurwitz matrices. Linear Alg. Appl. 274, 367–388
Davis, P.J. (1994): Circulant matrices. 2nd edition. Chelsea, New York
Gantmacher, F.R. (1959): The theory of matrices, vols. 1, 2. Chelsea, New York
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–213
Roman, S.M., Rota, G.-C. (1978): The umbral calculus. Adv. Math. 27, 95–188
Rota, G.-C., Kahaner, D., Odlyzko, A. (1973): On the foundations of combinatorial theory. VIII. Finite operator calculus. J. Math. Anal. Appl. 42, 684–760
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Italia
About this chapter
Cite this chapter
Barnabei, M., Montefusco, L.B. (2001). Circulant recursive matrices. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_7
Download citation
DOI: https://doi.org/10.1007/978-88-470-2107-5_7
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-2159-4
Online ISBN: 978-88-470-2107-5
eBook Packages: Springer Book Archive