Three different ways to obtain the values of hyper m-ary partition functions

Jiae Eom, Gyeonga Jeong, Jaebum Sohn

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

We consider a natural generalization of h2(n), denoted hm(n), which is the number of partitions of n into parts which are power of m ≥ 2 wherein each power of m is allowed to be used as a part at most m times. In this note, we approach in three different ways using the recurrences, the matrix and the tree to calculate the value of hm(n).

Original languageEnglish
Pages (from-to)1857-1868
Number of pages12
JournalBulletin of the Korean Mathematical Society
Volume53
Issue number6
DOIs
Publication statusPublished - 2016

Bibliographical note

Funding Information:
Third author’s research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (2011-0011257).

Publisher Copyright:
© 2016 Korean Mathematical Society.

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Three different ways to obtain the values of hyper m-ary partition functions'. Together they form a unique fingerprint.

Cite this