摘要
Motivated by the formula x(n) = (n)Sigma(k=0)((n)(k))(x-1)(k) we investigate factorizations of the lower-triangular Toeplitz matrix with (i, j )th entry equal to x(i-j) via the Pascal matrix. In this way, a new computational approach to the generalization of the binomial theorem is introduced. Numerous combinatorial identities are obtained from these matrix relations.
- 出版日期2013-4