A combinatorial proof of a Chebyshev polynomial identity

DOI10.1016/0012-365X(81)90069-8zbMATH Open0463.05007WikidataQ127831539 ScholiaQ127831539MaRDI QIDQ1153083FDOQ1153083

Authors: Louis W. Shapiro 

Publication date: 1981

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

zbMATH Keywords

Chebyshev polynomialsgenerating functionsFibonacci numbers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A combinational proof of the Mehler formula
• Notes on Generating Functions of Polynomials: (3) Polynomials of Legendre and Gegenbauer

Cited In (5)

• An extension of the Chebyshev polynomials
• The \(C\)-finite ansatz
• Combinatorial trigonometry with Chebyshev polynomials
• Binomial convolutions for rational power series
• Combinatorially composing Chebyshev polynomials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153083)