Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-06T00:21:13.101Z Has data issue: false hasContentIssue false
  • English
  • Français

Macmahon's partition analysis IX: K-gon partitions

Published online by Cambridge University Press:  17 April 2009

George E. Andrews ,
Peter Paule  and
Axel Riese
George E. Andrews
Affiliation:
Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, United States of America, e-mail: [email protected]
Peter Paule
Affiliation:
Research Institute for Symbolic Computation, Johannes Kepler University Linz, A–4040 Linz, Austria, e-mail: [email protected]
Axel Riese
Affiliation:
Research Institute for Symbolic Computation, Johannes Kepler University Linz, A–4040 Linz, Austria, e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Dedicated to George Szekeres on the occasion of his 90th birthday

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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 64 , Issue 2 , October 2001 , pp. 321 - 329
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Andrews, G.E., ‘A note on partitions and triangles with integer sides’, Amer. Math. Monthly 86 (1979), 477–478.CrossRefGoogle Scholar
[2]Andrews, G.E., ‘MacMahon's partition analysis II: Fundamental theorems’, Ann Comb. 4 (2000), 326–330.CrossRefGoogle Scholar
[3]Andrews, G.E., Paule, P. and Riese, A., MacMahon's partition analysis III: The Omega package, (SFB Report 99–24) (J. Kepler University, Linz, 1999), (to appear).Google Scholar
[4]Andrews, G.E., Paule, P. and Riese, A., MacMahon' partition analysis VI: a new reduction algorithm, (SFB Report 01–4) (J. Keplern University. Kinz, 2001), (to appear).Google Scholar
[5]Andrews, G.E., Paule, P. and Riese, A., MacMahon's partition alalysis VII: Constrained compositions, (SFB Report 01–5) (J. Kepler University, Linz, 2001), (to appear).Google Scholar
[6]Andrews, G.E., Paule, P. and Riese, A., MacMahon's partition analysis VIII: Plane Partition Diamonds, (SFB Reprot 01–6) (J. Kepler University, Linz, 2001), (to appear).Google Scholar
[7]Andrews, G.E., Paule, P., Riese, A. and Strehl, V., ‘MacMahon's partition analysis V: Bijections, recursions, and magic squares’, in Algebraic Combinatorics and Applications, (Betten, A. et al. , Editors) (Springer-Verlag, Berlin, 2001), pp. 1–39.Google Scholar
[8]Honsberger, R., Mathematical gems III (Math. Assoc. of America, Washington, 1985).CrossRefGoogle Scholar
[9]Jordan, J.H., Walsh, R. and Wisner, R.J., ‘Triangles with integer sides’, Notices Amer. Math. Soc. 24 (1977), A-450.Google Scholar
[10]Jordan, J.H., Walsh, R. and Wisner, R.J., ‘Triangles with integer sides’, Amer. Math. Monthly 86 (1979), 686–689.CrossRefGoogle Scholar
[11]Liu, C.I., Introduction to combinatorial mathematics (McGraw-Hill, New York, 1968).Google Scholar
[12]MacMahon, P.A., Combinatory analysis, (two volumes) (Cambridge University Press, Cambridge, 1915–1916); Reprinted: Chelsea, New York, (1960).Google Scholar
[13]Stanley, R.P., Enumerative combinatorics, Volume 1 (Wadsworth, Monterey, CA, 1986).CrossRefGoogle Scholar