A combinatorial proof of a Chebyshev polynomial identity

DOI10.1016/0012-365X(81)90069-8MaRDI QIDQ1153083zbMATH OpenWikidataFDO

Authors Louis W. Shapiro

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(81)90069-8

zbMATH Keywords

Chebyshev polynomialsFibonacci numbersgenerating functions

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

• A combinational proof of the Mehler formula
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Notes on Generating Functions of Polynomials: (3) Polynomials of Legendre and Gegenbauer

Cited in

(8)

• The \(C\)-finite ansatz
• An extension of the Chebyshev polynomials
• Binomial convolutions for rational power series
• Identities and Hadamard product of the generalized Fibonacci, Lucas, Catalan, and harmonic numbers
• On the generating functions of products mixing two k-Fibonacci and other sequences
• A new approach to MacMahon’s Partition Analysis and associated applications
• Combinatorial trigonometry with Chebyshev polynomials
• 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)