Combinatorial and Functional Identities in One-Parameter Matrices

DOI10.2307/2323499zbMath0622.05002OpenAlexW2331608453MaRDI QIDQ3758830

Dan Kalman, Abraham A. Ungar

Publication date: 1987

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323499

zbMATH Keywords

matrixidentitybinomial theoremLeibniz's rule

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items (8)

Infinite matrices in the theory of orthogonal polynomials ⋮ The Pascal functional matrices with multidimensional binomial coefficients ⋮ A unified approach to generalized Pascal-like matrices: \(q\)-analysis ⋮ On generalized \(q\)-hyperbolic functions in the spirit of Kapteyn, with corresponding \(q\)-Lie group ⋮ Generalized Leibniz functional matrices and divided difference form of the Lagrange-Bürmann formula ⋮ Generalized Leibniz functional matrices and factorizations of some well-known matrices ⋮ Matrix approach to polynomials. II ⋮ Permutable functions

This page was built for publication: Combinatorial and Functional Identities in One-Parameter Matrices