| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652932 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
Fibonacci (alias Chebyshev) polynomials enjoy particular composition properties. These can be seen (and proved) from a combinatorial perspective by interpreting these polynomials as matching polynomials. An enumerative technique for cyclic structures is applied to obtain a generating polynomial identity for cyclic products of binomial coefficients in terms of matching polynomials.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
