Title of article
Combinatorially composing Chebyshev polynomials
Author/Authors
Benjamin، نويسنده , , Arthur T. and Walton، نويسنده , , Daniel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
2161
To page
2167
Abstract
We present a combinatorial proof of two fundamental composition identities associated with Chebyshev polynomials. Namely, for all m , n ⩾ 0 , T m ( T n ( x ) ) = T mn ( x ) and U m − 1 ( T n ( x ) ) U n − 1 ( x ) = U mn − 1 ( x ) .
Keywords
Chebyshev polynomials , Tiling , combinatorial proof
Journal title
Journal of Statistical Planning and Inference
Serial Year
2010
Journal title
Journal of Statistical Planning and Inference
Record number
2220797
Link To Document