| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 472105 | Computers & Mathematics with Applications | 2009 | 9 Pages |
Abstract
Two types of symbolic summation formulas are reformulated using an extension of Mullin–Rota’s substitution rule in [R. Mullin, G.-C. Rota, On the foundations of combinatorial theory: III. Theory of binomial enumeration, in: B. Harris (Ed.), Graph Theory and its Applications, Academic Press, New York, London, 1970, pp. 167–213], and several applications involving various special formulas and identities are presented as illustrative examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tian-Xiao He, Leetsch C. Hsu, Dongsheng Yin,