Macmahon's partition analysis IX: K-gon partitions

George E. Andrews, Peter Paule, Axel Riese

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

MacMahon devoted a significant portion of Volume II of his famous book Combinatory Analysis to the introduction of Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. In a series of papers we have shown that MacMahon's method turns into an extremely powerful tool when implemented in computer algebra. In this note we explain how the use of the package Omega developed by the authors has led to a generalisation of a classical counting problem related to triangles with sides of integer length.

Original languageEnglish (US)
Pages (from-to)321-329
Number of pages9
JournalBulletin of the Australian Mathematical Society
Volume64
Issue number2
DOIs
StatePublished - Oct 2001

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Macmahon's partition analysis IX: K-gon partitions'. Together they form a unique fingerprint.

Cite this