Symbolization of generating functions; an application of the Mullin-Rota theory of binomial enumeration
DOI10.1016/j.camwa.2006.12.034zbMath1155.65300OpenAlexW2107831433MaRDI QIDQ1005802
Leetsch C. Hsu, Tian-Xiao He, Peter Jau-Shyong Shiue
Publication date: 10 March 2009
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.034
generating functionBell numbershift-invariant operatorEuler numberBernoulli numberbinomial enumerationBernoulli polynomialdelta operatorGenocchi numberEuler polynomialEulerian fractionsymbolic sum formula
Exact enumeration problems, generating functions (05A15) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Difference operators (39A70) Numerical summation of series (65B10)
Related Items
Cites Work
- Cycle indicators and special functions
- A symbolic operator approach to several summation formulas for power series
- Convergence of the summation formulas constructed by using a symbolic operator approach
- Combinatorial extreme value distributions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item