Divided Differences and Combinatorial Identities
We present an algebraic theory of divided differences which includes confluent differences, interpolation formulas, Liebniz's rule, the chain rule, and Lagrange inversion. Our approach uses only basic linear algebra. We also show that the general results about divided differences yield interesting combinatorial identities when we consider some suitable particular cases. For example, the chain rule gives us generalizations of the identity used by Good in his famous proof of Dyson's conjecture. We also obtain identities involving binomial coefficients, Stirling numbers, Gaussian coefficients, and harmonic numbers.
No Supplementary Data
No Article Media
Document Type: Research Article
Affiliations: Universidad Autónoma Metropolitana, Mexico
Publication date: October 1, 1991