Formal residue and computer proofs of combinatorial identities

Publication date 20 September 2011

Combinatorial identities, bijective combinatorics (05A19) Bell and Stirling numbers (11B73) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Abstract: The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended Zeilberger's algorithm, we generate recurrence relations for summations involving combinatorial sequences such as Stirling numbers. As examples, we give computer proofs of several known identities and derive some new identities. The applicability of this method is also studied.

This page was built for publication: Formal residue and computer proofs of combinatorial identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6227868)