You are here

Home » Content

A Short Proof for k-Gon Partitions

Journal Name:

  • Mathematica Æterna

Publication Year:

  • 2012

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
A k-gon partition is a non-decreasing sequence of k positive integers such that the last element is less than the sum of the others. By considering non-k-gon partitions, we derive the multivariable generating function for k-gon partitions, as given by Andrews, Paule and Riese.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-short-proof-k-gon-partitions.pdf
  • 4
283-285
  • English

REFERENCES

References: 

[1] G. E. Andrews, The Theory of Partitions, Encyclopedia of Mathematics
and Its Applications, Vol. 2, G.-C. Rota ed., Addison-Wesley, Reading,
1976.
[2] G. E. Andrews, P. Paule and Axel Riese, MacMahon’s Partition Analysis:
the Omega package, European J. Combin. 22 (2001), 887–904.
[3] G. E. Andrews, P. Paule and Axel Riese, MacMahon’s Partition Analysis
IX: k-Gon Partitions, Bull. Austral. Math. Soc. 64 (2001), 231–242.
[4] M. D. Hirschhorn, k-gon partitions, Bull. Austral. Math. Soc. 66 (1)
(2002), 149–150.
[5] G. C. Xin, A fast algorithm for MacMahon’s partition analysis, Electron.
J. Combin. 11 (2004), R58.

Thank you for copying data from http://www.arastirmax.com