Hostname: page-component-5447f9dfdb-xfldl Total loading time: 0 Render date: 2025-07-28T14:07:16.176Z Has data issue: false hasContentIssue false
  • English
  • Français

Bijective Proofs of Some n-Color Partition Identities

Part of: Combinatorics

Published online by Cambridge University Press:  20 November 2018

A. K. Agarwal
A. K. Agarwal*
Affiliation:
Department of Mathematics The Pennsylvania State University (Mont Alto Campus) Mont Alto, PA 17237, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

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.

Using a technique of Agarwal and Andrews (1987), bijective proofs of some n-color partition identities discovered recently by the author, are given.

MSC classification

Secondary: 05A17: Partitions of integers

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 32 , Issue 3 , 01 September 1989 , pp. 327 - 332
Copyright
Copyright © Canadian Mathematical Society 1989

References

1. Agarwal, A. K., Partitions with “N copies of N”, Lecture Notes in Mathematics, 1234, Proceedings of the Colloque De Combinatorie Enumerative, University of Quebec at Montreal, (1985), Springer-Verlag, 1–4.Google Scholar
2. Agarwal, A. K., Rogers-Ramanujan identities for n-color partitions, J. Number Theory, 28 (3), (1988), pp. 299–305.Google Scholar
3. Agarwal, A. K. and G. E. Andrews, Hook-differences and lattice paths, J. Statist. Plann. Inference, 14 (1986), 5–14.Google Scholar
4. Agarwal, A. K. and G. E. Andrews, Rogers-Ramanunujan identities for partitions with “N copies of ‘ N“, J. Combin. Theory Ser A, Vol. 45, No. 1, (1987), 40–49.Google Scholar
5. Rogers, L. J., Second memoir on the expansion of certain infinite products, Proc. London Math. Soc. 25 (1884), 318–343.Google Scholar