Back to search

West Virginia University

Chebyshev Polynomials and Fibonacci Numbers

Abstract

dc:description.abstract

The Chebyshev polynomials arise in several mathematical contexts such as approximation theory, numerical integration, and differential equations. Here we study a combinatorial interpretation of Chebyshev polynomials due to Shapiro, and we use it to give a slight variation of a combinatorial proof of Binet's Formula due to Benjamin, Derks and Quinn. Another beautiful formula for the Fibonacci numbers involves complex roots of unity. Presently, no combinatorial proof is known. We give combinatorial proofs of some related identities as progress toward a full combinatorial proof.

Degree

thesis:*
Name thesis:degree_name
MS
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wahyuni, Nurul
Contributors dc:contributor
  • Kevin G Milans
  • Harvey Diamond
  • Michael Mays

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Wahyuni, Nurul. Chebyshev Polynomials and Fibonacci Numbers. Thesis thesis, https://doi.org/10.33915/etd.6885