Formal residue and computer proofs of combinatorial identities

Details Formal residue and computer proofs of combinatorial identities Formal residue and computer proofs of combinatorial identities

2011-09-20

arxiv.org/abs/1109.4289v2

Mathematics

Combinatorics

14 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Formal residue and computer proofs of combinatorial identities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Formal residue and computer proofs of combinatorial identities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal residue and computer proofs of combinatorial identities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147178