Some binomial formulas of the generalized Appell form

DOI10.1016/S0022-247X(02)00359-1zbMath1014.33002MaRDI QIDQ1856885

Luis Verde-Star, Hari M. Srivastava

Publication date: 11 February 2003

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

recurrence relationsNewton polynomialsAppell generating functionsbasic exponential function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Exponential and trigonometric functions (33B10)

Related Items (3)

Some combinatorial identities of the degenerate Bernoulli and Euler-Genocchi polynomials ⋮ On another approach for a family of Appell polynomials ⋮ Triangular expansions

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Stirling and Lah numbers
• Some characterizations of Appell and q-Appell polynomials
• A generalization of the Stirling numbers
• A unified approach to generalized Stirling numbers
• Sequences of binomial type with persistent roots
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• Divided Differences and Combinatorial Identities
• Generalized Stirling Numbers, Convolution Formulae and p, q-Analogues
• The group of generalized Stirling numbers

This page was built for publication: Some binomial formulas of the generalized Appell form