Partition identities and the coin exchange problem

@article{Holroyd2008PartitionIA,
  title={Partition identities and the coin exchange problem},
  author={Alexander E. Holroyd},
  journal={J. Comb. Theory, Ser. A},
  year={2008},
  volume={115},
  pages={1096-1101}
}
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes identities of MacMahon and Andrews. The analogous identities for three or more integers (in place of a, b) hold in certain cases. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

MacMahon's partition identity and the coin exchange problem

J. Comb. Theory, Ser. A • 2009
View 6 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 12 references

On subinvariants , i . e . semiinvariants to binary quantities of an unlimited order

J. J. Sylvester
Ramı́rez Alfonśın . The Diophantine Frobenius problem , volume 30 of Oxford Lecture Series in Mathematics and its Applications • 2005

Partitions with short sequences and mock theta functions.

Proceedings of the National Academy of Sciences of the United States of America • 2005
View 1 Excerpt

Ramı́rez Alfonśın. The Diophantine Frobenius problem, volume 30 of Oxford Lecture Series in Mathematics and its Applications

J L.
2005

The theory of partitions

G. E. Andrews
Reprint of the 1976 original • 1998

Generating functions for the Frobenius problem with 2 and 3 generators

L. A. Székely, N. C. Wormald
Math. Chronicle, • 1986
View 2 Excerpts

Similar Papers

Loading similar papers…