A fast algorithm for MacMahon's partition analysis (Q1883677): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:00, 1 February 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for MacMahon's partition analysis
scientific article

    Statements

    A fast algorithm for MacMahon's partition analysis (English)
    0 references
    0 references
    13 October 2004
    0 references
    Summary: 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.
    0 references

    Identifiers