TRIPLE FACTORIZATION OF SOME RIORDAN MATRICES
暂无分享,去创建一个
In a recent paper [2], techniques are discussed that assist in finding closed-form expressions for the formal power series for a select, but large, set of combinatorial sequences. The methods involve using infinite matrices and the Riordan group. The Riordan group is defined in section 2 of this paper. Each matrix, L, in the Riordan group is associated with a combinatorial sequence and with a matrix, SL, called the Stieltjes matrix. SL is defined in section 3. In this paper, we show that when SL is tridiagonal, then L= PCF, where the first factor P is a Pascal-type matrix, the second factor C involves the generating function for the Catalan numbers, and the third factor F involves the Fibonacci generating function. The following is an example:
[1] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .
[2] Louis W. Shapiro,et al. The Riordan group , 1991, Discret. Appl. Math..