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

Jiae Eom, Gyeonga Jeong, Jaebum Sohn

Research output: Contribution to journalArticle

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 Jan 1

Fingerprint

Partition Function
Recurrence
Partition
Calculate
Generalization

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

@article{cbb51ee8185e4d3bb82edb8569f595b8,
title = "Three different ways to obtain the values of hyper m-ary partition functions",
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).",
author = "Jiae Eom and Gyeonga Jeong and Jaebum Sohn",
year = "2016",
month = "1",
day = "1",
doi = "10.4134/BKMS.b151039",
language = "English",
volume = "53",
pages = "1857--1868",
journal = "Bulletin of the Korean Mathematical Society",
issn = "1015-8634",
publisher = "Korean Mathematical Society",
number = "6",

}

Three different ways to obtain the values of hyper m-ary partition functions. / Eom, Jiae; Jeong, Gyeonga; Sohn, Jaebum.

In: Bulletin of the Korean Mathematical Society, Vol. 53, No. 6, 01.01.2016, p. 1857-1868.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Eom, Jiae

AU - Jeong, Gyeonga

AU - Sohn, Jaebum

PY - 2016/1/1

Y1 - 2016/1/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=84996536362&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84996536362&partnerID=8YFLogxK

U2 - 10.4134/BKMS.b151039

DO - 10.4134/BKMS.b151039

M3 - Article

VL - 53

SP - 1857

EP - 1868

JO - Bulletin of the Korean Mathematical Society

JF - Bulletin of the Korean Mathematical Society

SN - 1015-8634

IS - 6

ER -