Return to search

A Tiling Approach to Chebyshev Polynomials

We present a combinatorial interpretation of Chebyshev polynomials. The nth Chebyshev polynomial of the first kind, Tn(x), counts the sum of all weights of n-tilings using light and dark squares of weight x and dominoes of weight −1, and the first tile, if a square must be light. If we relax the condition that the first square must be light, the sum of all weights is the nth Chebyshev polynomial of the second kind, Un(x). In this paper we prove many of the beautiful Chebyshev identities using the tiling interpretation.

Identiferoai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1207
Date01 May 2007
CreatorsWalton, Daniel
PublisherScholarship @ Claremont
Source SetsClaremont Colleges
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceHMC Senior Theses

Page generated in 0.0019 seconds