Abstract
A significant portion of MacMahon’s famous book “Combinatory Analysis” is devoted to the development of “Partition Analysis” as a computational method for solving problems in connection with linear homogeneous diophantine inequalities and equations, respectively. Nevertheless, MacMahon’s ideas have not received due attention with the exception of work by Richard Stanley. A long range object of a series of articles is to change this situation by demonstrating the power of MacMahon’s method in current combinatorial and partition-theoretic research. The renaissance of MacMahon’s technique partly is due to the fact that it is ideally suited for being supplemented by modern computer algebra methods. In this paper we illustrate the use of Partition Analysis and of the corresponding package Omega by focusing on three different aspects of combinatorial work: the construction of bisections (for the Refined Lecture Hall Partition Theorem), exploitation of recursive patterns (for Cayley compositions), and finding nonnegative integer solutions of linear systems of diophantine equations (for magic squares of size 3).
Dedicated to Professor A. Kerber at the occasion of his 60th birthday
Partially supported by National Science Foundation Grant DMS-9870060.
Supported by SFB-grant F1305 of the Austrian FWF.
Supported by a visiting researcher grant of the J. Kepler University Linz.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. E. Andrews, The Theory of Partitions, Encyclopedia of Mathematics and Its Applications, Vol. 2, G.-C. Rotaed., Addison-Wesley, Reading, 1976. (Reissued: Cambridge University Press, Cambridge, 1985.)
G. E. Andrews, The Rogers-Ramanujan reciprocal and Mine’s partition function, Pacific J. Math. 95 (1981), 251–256.
G. E. Andrews, MacMahon’s partition analysis I: The lecture hall partition theoremin “Mathematical essays in honor of Gian-Carlo Rota’s 65th birthday” (B.E. Sagan), Prog. Math. 161, Birkhauser, Boston, 1998, pp. 1–22.
G. E. Andrews, P. Paule and A. Riese, MacMahon’s partition analysis III: The Omega package, (to appear).
G. E. Andrews, P. Paule and A. Riese, MacMahon’s partition analysis VI: The fast algorithm, (in preparation).
C. Bessenrodt, A bijection for Lebesgue’s identity in the spirit of Sylvester, Discrete Math. 132 (1994), 1–10.
M. Bousquet-Mélou and K. Eriksson, Lecture hall partitions, Ramanujan J. 1 (1997), 101–111.
M. Bousquet-Mélou and K. Eriksson, Lecture hall partitions II, Ramanujan J. 1 (1997), 165–187.
A. Cayley, On a problem in the partition of numbers, Philosophical Mag. 13 (1857), 245–248 (reprinted: The Coll. Math. Papers of A. Cayley, Vol. Ill, Cambridge University Press, Cambridge, 1890, pp. 247–249 ).
D. Hilbert, Uber die Theorie der algebraischen Formen, Math. Ann. 36 (1890), 473–534.
D. Kim and A.J. Yee, A note on partitions into distinct parts and odd parts, Ramanujan J. 3 (1999), 227–231.
P. A. MacMahon, Combinatory Analysis, 2 vols., Cambridge University Press, Cambridge, 1915–16 (reprinted: Chelsea, New York, 1960 ). MacMahon’s Partition Analysis V
H. Mine, The free commutative entropie log arithmetic, Proc. Roy. Soc. Edinburgh 65 (1959), 177–192.
H. Mine, A problem in partitions: Enumeration of elements of a given degree in the free commutative entropie groupoid, Proc. Edinburgh Math. Soc. 11 (1959), 223–224.
R. P. Stanley, Linear homogeneous diophantine equations and magic labelings of graphs, Duke Math. J. 40 (1973), 607–632.
R. P. Stanley, Combinatorics and Commutative Algebra, Birkhäuser, Boston, 1983.
R. P. Stanley, Enumerative Combinatorics — Volume 1, Wadsworth, Monterey, California, 1986.
A. J. Yee, On Combinatorics of Lecture Hall Partitions, (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrews, G.E., Paule, P., Riese, A., Strehl, V. (2001). MacMahon’s Partition Analysis V: Bijections, Recursions, and Magic Squares. In: Betten, A., Kohnert, A., Laue, R., Wassermann, A. (eds) Algebraic Combinatorics and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59448-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-59448-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41110-9
Online ISBN: 978-3-642-59448-9
eBook Packages: Springer Book Archive