Skip to main content
padlock icon - secure page this page is secure

Divided Differences and Combinatorial Identities

Buy Article:

$59.00 + tax (Refund Policy)

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 References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Affiliations: Universidad Autónoma Metropolitana, Mexico

Publication date: October 1, 1991

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more