A fast algorithm for MacMahon's partition analysis
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(46)- A Macsyma implementation of Zeilberger's fast algorithm
- Generating functions of weighted voting games, MacMahon's partition analysis, and Clifford algebras
- Matrix computations with the Omega calculus
- On the Schur positivity of \(\Delta_{e_{2}} e_n[X]\)
- On the enumeration of certain weighted graphs
- Constant term methods in the theory of Tesler matrices and Macdonald polynomial operators
- Completing the classification of representations of \(SL_n\) with complete intersection invariant ring
- On parity unimodality of \(q\)-Catalan polynomials
- Generalized power series with a limited number of factorizations
- A combinatorial approach to Frobenius numbers of some special sequences
- On the \(q\)-Dyson orthogonality problem
- MacMahon’s Dream
- Generalization of Stanley's monster reciprocity theorem
- Leading coefficients of Morris type constant term identities
- A new plethystic symmetric function operator and the rational compositional shuffle conjecture at \(t=1/q\)
- Two families of constant term identities
- The AFLT \(q\)-Morris constant term identity
- The combinatorics of \(k\)-marked Durfee symbols
- Hilbert series of invariants, constant terms and Kostka-Foulkes polynomials
- Stretched Newell-Littlewood coefficients
- Enumeration of bilaterally symmetric 3-noncrossing partitions
- On the probability that finite spaces with random distances are metric spaces
- Determinant formulas relating to tableaux of bounded height
- Bounded Factorization and the Ascending Chain Condition on Principal Ideals in Generalized Power Series Rings
- A family of \(q\)-Dyson style constant term identities
- On \(P\)-partitions related to ordinal sums of posets
- Invariant rings of sums of fundamental representations of \(\operatorname{SL}_n\) and colored hypergraphs
- Weitzenböck derivations of free metabelian Lie algebras
- Mahonian partition identities via polyhedral geometry
- A general algorithm for the MacMahon Omega operator
- A Euclid style algorithm for MacMahon's partition analysis
- MacMahon's partition analysis: The Omega package
- MacMahon partition analysis: a discrete approach to broken stick problems
- Invariants of symplectic and orthogonal groups acting on \(\mathrm{GL}(n, \mathbb{C})\)-modules
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- The \(q, t\)-symmetry of the generalized \(q, t\)-Catalan number \(C_{(k_1,k_2,k_3)}(q,t)\)
- Invariants, Kronecker products, and combinatorics of some remarkable Diophantine systems
- A residue theorem for Malcev-Neumann series.
- Towards the geometry of double Hurwitz numbers
- Using Rota's Umbral calculus to enumerate Stanley's P-partitions
- Generating functions for the quotients of numerical semigroups
- Constructing all magic squares of order three
- Symmetrically constrained compositions
- On magic distinct labellings of simple graphs
- MacMahon's partition analysis. VI: A new reduction algorithm
- An algebraic approach to \(q\)-partial fractions and Sylvester denumerants
This page was built for publication: A fast algorithm for MacMahon's partition analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883677)
