A fast algorithm for MacMahon's partition analysis

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages 1-20

  Xin, Guoce ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5344229440     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1811     Document Type: Article

References (20)

1. G. E. Andrews, MacMahon's partition analysis. I. The lecture hall partition theorem, Mathematical essays in honor of Gian-Carlo Rota (Cambridge, MA, 1996), Progr. Math., vol. 161, Birkhäuser Boston, Boston, MA, 1998, pp. 1-22.
2. _, MacMahon's partition analysis. II. Fundamental theorems, Ann. Comb. 4 (2000), 327-338, Conference on Combinatorics and Physics (Los Alamos, NM, 1998).
3. G. E. Andrews and P. Paule, MacMahon's partition analysis. IV. Hypergeometric multisums, Sém. Lothar. Combin. 42 (1999), Art. B42i, 24 pp. (electronic), The Andrews Festschrift (Maratea, 1998).
4. G. E. Andrews, P. Paule, and A. Riese, MacMahon's partition analysis. IX. k-gon partitions, Bull. Austral. Math. Soc. 64 (2001), 321-329.
5. _, MacMahon's partition analysis: the Omega package, European J. Combin. 22 (2001).
6. _, MacMahon's partition analysis. VI. A new reduction algorithm, Ann. Comb. 5 (2001), 251-270, Dedicated to the memory of Gian-Carlo Rota (Tianjin, 1999).
7. _, MacMahon's partition analysis. VII. Constrained compositions, q-series with applications to combinatorics, number theory, and physics (Urbana, IL, 2000), Con-temp. Math., vol. 291, Amer. Math. Soc., Providence, RI, 2001, pp. 11-27.
8. _, MacMahon's partition analysis. VIII. Plane partition diamonds, Adv. in Appl. Math. 27 (2001), 231-242, Special issue in honor of Dominique Foata's 65th birthday (Philadelphia, PA, 2000).
9. G. E. Andrews, P. Paule, A. Riese, and V. Strehl, MacMahon's partition analysis. V. Bijections, recursions, and magic squares, Algebraic combinatorics and applications (Gößweinstein, 1999), Springer, Berlin, 2001, pp. 1-39.
10. W. Baldoni-Silva and M. Vergne, Residues formulae for volumes and Ehrhart polynomials of convex polytopes, preprint, arXiv:math.CO/0103097, 2001.
11. C. S. Chan, D. P. Robbins, and D. S. Yuen, On the volume of a certain polytope, Experiment. Math. 9 (2000), no. 1, 91-99.
12. G. N. Han, A general algorithm for the MacMahon Omega operator, Ann. of Comb. 7 (2003), 467-480.
13. P. A. MacMahon, Combinatory Analysis, vol. 2, Cambridge University Press, Cambridge, 1915-1916, Reprinted: Chelsea, New York, 1960.
14. R. P. Stanley, Combinatorial reciprocity theorems, Adv. in Math. 14 (1974), 194-253.
15. _, Enumerative Combinatorics, 2 ed., vol. 1, Cambridge University Press, 1997.
16. K. G. Wilson, Proof of a conjecture by Dyson, J. Math. Phys. 3 (1962), 1040-1043.
17. G. Xin, A fast algorithm for partial fraction decompositions, J. Symbolic Comput. (2004), submitted.
18. G. Xin, The Ring of Malcev-Neumann Series and The Residue Theorem, Ph.D. thesis, Brandeis University, 2004, arXiv:math.CO/0405133.
19. Guoce Xin, A Maple package for the constant terms of Elliott-rational functions, (2004, http://www.brandeis.edu/~maxima/maple/Ell.mpl,.
20. D. Zeilberger, Proof of a conjecture of Chan, Robbins, and Yuen, Elec. Trans. Numer. Anal. 9 (1999), 147-148.