A Fast Algorithm for MacMahon's Partition Analysis
| dc.creator | Xin, Guoce | |
| dc.date | 2004-08-27 | |
| dc.date.accessioned | 2026-07-07T05:11:36Z | |
| dc.date.available | 2026-07-07T05:11:36Z | |
| dc.description | 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. | |
| dc.description | 22 pages | |
| dc.identifier | https://arxiv.org/abs/math/0408377 | |
| dc.identifier | http://arxiv.org/abs/math/0408377 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72298 | |
| dc.subject | Combinatorics | |
| dc.subject | 11Y50 | |
| dc.title | A Fast Algorithm for MacMahon's Partition Analysis | |
| dc.type | text |