Partitions into specified parts which appear a specified number of times
HTML articles powered by AMS MathViewer
- by Elmo Moore PDF
- Proc. Amer. Math. Soc. 52 (1975), 23-29 Request permission
Abstract:
Restrictions of this type, which are known to produce partition identities when any natural number may be used as a part, are shown to produce partition identities when only certain parts may be used.References
- H. L. Alder, Partition identities—from Euler to the present, Amer. Math. Monthly 76 (1969), 733–746. MR 263766, DOI 10.2307/2317861
- George E. Andrews, Number theory, W. B. Saunders Co., Philadelphia, Pa.-London-Toronto, Ont., 1971. MR 0309838
- George E. Andrews, Two theorems of Euler and a general partition theorem, Proc. Amer. Math. Soc. 20 (1969), 499–502. MR 233791, DOI 10.1090/S0002-9939-1969-0233791-6 J. W. L. Glaisher, Messenger Math. 12 (1883), 158-170. G. Lord, Ph.D. Thesis, Temple University, March 1971.
- Elmo Moore, Generalized Euler-type partition identities, J. Combinatorial Theory Ser. A 17 (1974), 78–83. MR 344190, DOI 10.1016/0097-3165(74)90029-6
- Elmo Moore, Partitions with parts appearing a specified number of times, Proc. Amer. Math. Soc. 46 (1974), 205–210. MR 349576, DOI 10.1090/S0002-9939-1974-0349576-8
- M. V. Subbarao, Partition theorems for Euler pairs, Proc. Amer. Math. Soc. 28 (1971), 330–336. MR 274410, DOI 10.1090/S0002-9939-1971-0274410-1
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 52 (1975), 23-29
- MSC: Primary 10A45
- DOI: https://doi.org/10.1090/S0002-9939-1975-0387180-7
- MathSciNet review: 0387180