MacMahon's partition analysis. VI: A new reduction algorithm
From MaRDI portal
Publication:1600815
DOI10.1007/s00026-001-8011-yzbMath1027.05005OpenAlexW1978565415MaRDI QIDQ1600815
Axel Riese, George E. Andrews, Paule, Peter
Publication date: 16 June 2002
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-001-8011-y
Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Analytic theory of partitions (11P82) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items (12)
Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ MacMahon’s Dream ⋮ A fast algorithm for computing the number of magic series ⋮ On Sloane's generalization of non-squashing stacks of boxes ⋮ Constructing all magic squares of order three ⋮ A Euclid style algorithm for MacMahon's partition analysis ⋮ Partition analysis and symmetrizing operators ⋮ MacMahon's partition analysis. VIII: Plane partition diamonds ⋮ Unnamed Item ⋮ On parity unimodality of \(q\)-Catalan polynomials ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras ⋮ On \(P\)-partitions related to ordinal sums of posets
Uses Software
This page was built for publication: MacMahon's partition analysis. VI: A new reduction algorithm
