Author:
Andrews George E.,Paule Peter,Riese Axel
Abstract
Dedicated to George Szekeres on the occasion of his 90th birthdayMacMahon devoted a significant portion of Volume II of his famous bookCombinatory Analysisto 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.
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. Triangles with Integer Sides
2. Triangles with integer sides;Jordan;Notices Amer. Math. Soc.,1977
3. Mathematical Gems III
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. GENERATING FUNCTIONS FOR THE QUOTIENTS OF NUMERICAL SEMIGROUPS;Bulletin of the Australian Mathematical Society;2024-02-29
2. MacMahon Partition Analysis: A discrete approach to broken stick problems;Journal of Combinatorial Theory, Series A;2022-04
3. INTEGER POLYGONS OF GIVEN PERIMETER;Bulletin of the Australian Mathematical Society;2019-01-30
4. Polyhedral Omega: a New Algorithm for Solving Linear Diophantine Systems;Annals of Combinatorics;2017-04-26
5. Mahonian Partition Identities via Polyhedral Geometry;From Fourier Analysis and Number Theory to Radon Transforms and Geometry;2012-07-30