A Fast Algorithm for MacMahon's Partition Analysis
Keyword(s):
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.
2012 ◽
Vol 43
(6)
◽
pp. 784-789
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
2018 ◽
Vol 2018
◽
pp. 1-6
Keyword(s):