Further combinatorial identities deriving from the \(n\)th power of a \(2\times 2\) matrix (Q2495912)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further combinatorial identities deriving from the \(n\)th power of a \(2\times 2\) matrix |
scientific article |
Statements
Further combinatorial identities deriving from the \(n\)th power of a \(2\times 2\) matrix (English)
0 references
30 June 2006
0 references
In a previous paper [Integers 4, Paper A19, electronic only (2004; Zbl 1123.05300)] the first author obtained a formula for the \(n\)th power of a \(2\times 2\) matrix and used it to derive various binomial identities. The present paper continues this work; the formula is used to derive a variety of other combinatorial identities. For example, the functional equation \[ f_{mn}(x,s)= f_m(x, s) f_n(f_{m+1}(x, s)+ sf_{m-1}(x, s),-(- s)^m) \] is obtained for the generalized Fibonacci polynomial \[ f_m(x,s)= \sum^{\lfloor{1\over 2}(m-1)\rfloor}_{k=0} {m-k-1\choose k} x^{m-2k-1} s^k. \]
0 references
