A combinatorial proof of a Chebyshev polynomial identity

DOI10.1016/0012-365X(81)90069-8zbMath0463.05007WikidataQ127831539 ScholiaQ127831539MaRDI QIDQ1153083

Louis W. Shapiro

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionsChebyshev polynomialsFibonacci numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (5)

The \(C\)-finite ansatz ⋮ Unnamed Item ⋮ An extension of the Chebyshev polynomials ⋮ Combinatorial trigonometry with Chebyshev polynomials ⋮ Combinatorially composing Chebyshev polynomials

Cites Work

• Unnamed Item
• A combinational proof of the Mehler formula
• Notes on Generating Functions of Polynomials: (3) Polynomials of Legendre and Gegenbauer

This page was built for publication: A combinatorial proof of a Chebyshev polynomial identity