A Fast Algorithm for MacMahon's Partition Analysis

Details A Fast Algorithm for MacMahon's Partition Analysis A Fast Algorithm for MacMahon's Partition Analysis

2004-08-27

arxiv.org/abs/math/0408377v1

Mathematics

Combinatorics

22 pages

Scientific paper

This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immediately from its partial fraction decomposition. We combine the theory of iterated Laurent series and a new algorithm for partial fraction decompositions to obtain a fast algorithm for MacMahon's Omega calculus, which (partially) avoids the "run-time explosion" problem when eliminating several variables. We discuss the efficiency of our algorithm by investigating problems studied by Andrews and his coauthors; our running time is much less than that of their Omega package.

Affiliated with

Also associated with

No associations

Rating

A Fast Algorithm for MacMahon's Partition Analysis 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 A Fast Algorithm for MacMahon's Partition Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm for MacMahon's Partition Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211162