Skip to main content
Springer logoLink to Springer
. 2017 Apr 28;2017(1):84. doi: 10.1186/s13660-017-1359-2

Fourier series of sums of products of ordered Bell and poly-Bernoulli functions

Taekyun Kim 1,2, Dae San Kim 3, Dmitry V Dolgy 4, Jin-Woo Park 5,
PMCID: PMC5408063  PMID: 28515616

Abstract

In this paper, we study three types of sums of products of ordered Bell and poly-Bernoulli functions and derive their Fourier series expansion. In addition, we express those functions in terms of Bernoulli functions.

Keywords: Fourier series, ordered Bell function, poly-Bernoulli function

Introduction

The ordered Bell polynomials bm(x) are defined by the generating function

12etext=m=0bm(x)tmm!. 1

Thus they form an Appell sequence. For x=0, bm=bm(0), (m0) are called ordered Bell numbers which have been studied in various counting problems in number theory and enumerative combinatorics (see [1, 4, 5, 16, 17, 19]). The ordered Bell numbers are all positive integers, as we can see, for example, from

bm=n=0mn!S2(m,n)=n=0nm2n+1(m0).

The first few ordered Bell polynomials are as follows:

b0(x)=1,b1(x)=x+1,b2(x)=x2+2x+3,b3(x)=x3+3x2+9x+13,b4(x)=x4+4x3+18x2+52x+75,b5(x)=x5+5x4+30x3+130x2+375x+541.

From (1), we can derive

ddxbm(x)=mbm1(x)(m1),bm(x+1)+2bm(x)=xm(m0).

From these, in turn, we have

bm(1)+2bm=δm,0(m0),01bm(x)dx=1m+1(bm+1(1)mm+1)int01bm(x)dx=1m+1bm+1.

For any integer r, the poly-Bernoulli polynomials of index r Bm(r)(x) are given by the generating function (see [2, 3, 710, 12, 13, 20])

Lir(1et)et1ext=m=0Bm(r)(x)tmm!,

where Lir(x)=m=1xmmr is the polylogarithmic function for r1 and a rational function for r0.

We note here that

ddx(Lir+1(x))=1xLir(x).

Also, we need the following for later use.

ddxBm(r)(x)=mBm1(r)(x)(m1),Bm(1)(x)=Bm(x),B0(r)(x)=1,Bm(0)(x)=xm,Bm(0)=δm,0,Bm(r+1)(1)Bm(r+1)(0)=Bm1(r)(m1),01Bm(r)(x)dx=1m+1(Bm+1(r)(1)Bm+1(r)(0))01Bm(r)(x)dx=1m+1Bm(r1).

Here the Bernoulli polynomials Bm(x) are given by the generating function

tet1ext=m=0Bm(x)tmm!.

For any real number x, we let

x=xx[0,1)

denote the fractional part of x.

Finally, we recall the following facts about Bernoulli functions Bm(x):

  1. for m2,
    Bm(x)=m!n=n0e2πinx(2πin)m;
  2. for m=1,
    n=n0e2πinx2πin={B1(x),for xZ,0,for xZ.

Here we will study three types of sums of products of ordered Bell and poly-Bernoulli functions and derive their Fourier series expansion. In addition, we will express those functions in terms of Bernoulli functions.

  1. αm(x)=k=0mbk(x)Bmk(r+1)(x),(m1);

  2. βm(x)=k=0m1k!(mk)!bk(x)Bmk(r+1)(x),(m1);

  3. γm(x)=k=1m11k(mk)bk(x)Bmk(r+1)(x),(m2).

For elementary facts about Fourier analysis, the reader may refer to any book (for example, see [18, 21]).

As to γm(x), we note that the next polynomial identity follows immediately from Theorems 4.1 and 4.2, which is in turn derived from the Fourier series expansion of γm(x):

k=1m11k(mk)bk(x)Bmk(r+1)(x)=1ms=0m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x),

where Hl=j=1l1j are the harmonic numbers and

Λl=k=1l11k(lk)bkBlk(r+1)+2k=1l11k(lk)bkBlk1(r),

with Λ1=0.

The polynomial identities can be derived also for the functions αm(x) and βm(x) from Theorems 2.1 and 2.2, and Theorems 3.1 and 3.2, respectively. We refer the reader to [6, 11, 14, 15] for the recent papers on related works.

Fourier series of functions of the first type

Let

αm(x)=k=0mbk(x)Bmk(r+1)(x),

where r,m are integers with m1. Then we will study the function

αm(x)=k=0mbk(x)Bmk(r+1)(x)(m1),

defined on R which is periodic with period 1.

The Fourier series of αm(x) is

n=An(m)e2πinx,

where

An(m)=01αm(x)e2πinxdx=01αm(x)e2πinxdx.

Before proceeding further, we observe the following

αm(x)=k=0m{kbk1(x)Bmk(r+1)(x)+(mk)bkBmk1(r+1)(x)}=k=1mkbk1(x)Bmk(r+1)(x)+k=0m1(mk)bk(x)Bmk1(r+1)(x)=k=0m1(k+1)bk(x)Bmk1(r+1)(x)+k=0m1(mk)bk(x)Bmk1(r+1)(x)=(m+1)αm1(x).

Thus (αm+1(x)m+2)=αm(x), and so 01αm(x)dx=1m+2(αm+1(1)αm+1(0)). For m1, we put

Δm=αm(1)αm(0)=k=0mbk(1)Bmk(r+1)(1)k=0mbkBmk(r+1)=k=0m1(2bkδk,0)(Bmk(r+1)+Bmk1(r))+2bmδm,0k=0mbkBmk(r+1)=2k=0m1bkBmk(r+1)+2k=0m1bkBmk1(r)Bm(r+1)Bm1(r)+bmk=0m1bkBmk(r+1)=k=1mbkBmk(r+1)+2k=0m1bkBmk1(r)Bm1(r).

Thus, αm(0)=αm(1)Δm=0 and 01αm(x)dx=1m+2Δm+1.

Now, we want to determine the Fourier coefficients An(m).

Case 1: n0.

An(m)=01αm(x)e2πinxdx=12πin[αm(x)e2πinx]01+12πin01αm(x)e2πinxdx=m+12πin01αm1(x)e2πinxdx12πin(αm(1)αm(0))=m+12πinAn(m1)12πinΔm=m+12πin(m2πinAn(m2)12πinΔm1)12πinΔm=(m+1)2(2πin)2An(m2)j=12(m+1)j1(2πin)jΔmj+1==(m+1)m(2πin)mAn(0)j=1m(m+1)j1(2πin)jΔmj+1=1m+2j=1m(m+2)j(2πin)jΔmj+1,

where we note that An(0)=01e2πinxdx=0.

Case 2: n=0.

A0(m)=01αm(x)dx=1m+2Δm+1.

αm(x), (m1) is piecewise C. Moreover, αm(x) is continuous for those positive integers m with Δm=0 and discontinuous with jump discontinuities at integers for those positive integers m with Δm0.

Assume first that m is a positive integer with Δm=0. Then αm(0)=αm(1). Hence αm(x) is piecewise C and continuous. Thus the Fourier series of αm(x) converges uniformly to αm(x), and

αm(x)=1m+2Δm+1+n=n0(1m+2j=1m(m+2)j(2πin)jΔmj+1)e2πinx=1m+2Δm+1+1m+2j=1m(m+2j)Δmj+1(j!n=n0e2πinx(2πin)j)=1m+2Δm+1+1m+2j=2m(m+2j)Δmj+1Bj(x)+Δm×{B1(x),for xZ,0,for xZ.

Now, we can state our first theorem.

Theorem 2.1

For each positive integer l, we let

Δl=k=1lbkBlk(r+1)+2k=0l1bkBlk1(r)Bl1(r).

Assume that Δm=0 for a positive integer m. Then we have the following

  1. k=0mbk(x)Bmk(r+1)(x) has the Fourier series expansion
    k=0mbk(x)Bmk(r+1)(x)=1m+2Δm+1+n=n0(1m+2j=1m(m+2)j(2πin)jΔmj+1)e2πinx,
    for all xR, where the convergence is uniform.
  2. k=0mbk(x)Bmk(r+1)(x)=1m+2Δm+1+1m+2j=2m(m+2j)Δmj+1Bj(x),
    for all xR, where Bj(x) is the Bernoulli function.

Assume next that Δm0 for a positive integer m. Then αm(0)αm(1). So αm(x) is piecewise C and discontinuous with jump discontinuities at integers. The Fourier series of αm(x) converges pointwise to αm(x), for xZ, and converges to

12(αm(0)+αm(1))=αm(0)+12Δm,

for xZ.

Now, we can state our second theorem.

Theorem 2.2

For each positive integer l, we let

Δl=k=1lbkBlk(r+1)+2k=0l1bkBlk1(r)Bl1(r).

Assume that Δm0 for a positive integer m. Then we have the following.

  1. 1m+2Δm+1+n=n0(1m+2j=1m(m+2)j(2πin)jΔmj+1)e2πinx={k=0mbk(x)Bmk(r+1)(x),for xZ,k=0mbkBmk(r+1)+12Δm,for xZ;
  2. 1m+2Δm+1+1m+2j=1m(m+2j)Δmj+1Bj(x)=k=0mbk(x)Bmk(r+1)(x),for xZ;1m+2Δm+1+1m+2j=2m(m+2j)Δmj+1Bj(x)=k=0mbkBmk(r+1)+12Δm,for xZ.

Fourier series of functions of the second type

Let βm(x)=k=0m1k!(mk)!bk(x)Bmk(r+1)(x), where r,m are integers with m1. Then we will investigate the function

βm(x)=k=0m1k!(mk)!bk(x)Bmk(r+1)(x),

defined on R, which is periodic with period 1.

The Fourier series of βm(x) is

n=Bn(m)e2πinx,

where

Bn(m)=01βm(x)e2πinxdx=01βm(x)e2πinxdx.

Before proceeding further, we note the following.

βm(x)=k=0m{kk!(mk)!bk1(x)Bmk(r+1)(x)+mkk!(mk)!bk(x)Bmk1(r+1)(x)}=k=1m1(k1)!(mk)!bk1(x)Bmk(r+1)(x)+k=0m11k!(mk1)!bk(x)Bmk1(r+1)(x)=k=0m11k!(mk1)!bk(x)Bmk1(r+1)(x)+k=0m11k!(m1k)!bk(x)Bmk1(r+1)(x)=2βm1(x).

Thus

(βm+1(x)2)=βm(x),and01βm(x)dx=12(βm+1(1)βm+1(0)).

For m1, we put

Ωm=βm(1)βm(0)=k=0m1k!(mk)!bk(1)Bmk(r+1)(1)k=0m1k!(mk)!bkBmk(r+1)=k=0m11k!(mk)!(2bkδk,0)(Bmk(r+1)+Bmk1(r))+1m!(2bmδm,0)k=0m1k!(mk)!bkBmk(r+1)=2k=0m11k!(mk)!bkBmk(r+1)+2k=0m11k!(mk)!bkBmk1(r)1m!Bm(r+1)1m!Bm1(r)+1m!bmk=0m11k!(mk)!bkBmk(r+1)=k=1m1k!(mk)!bkBmk(r+1)+2k=0m11k!(mk)!bkBmk1(r)1m!Bm1(r).

Hence

βm(0)=βm(1)Ωm=0,and01βm(x)dx=12Ωm+1.

We now would like to determine the Fourier coefficients Bn(m).

Case 1: n0.

Bn(m)=01βm(x)e2πinxdx=12πin[βm(x)e2πinx]01+12πin01βm(x)e2πinxdx=12πin(βm(1)βm(0))+22πin01βm1(x)e2πinxdx=22πinBn(m1)12πinΩm=22πin(22πinBn(m2)12πinΩm1)12πinΩm=(22πin)2Bn(m2)j=122j1(2πin)jΩmj+1==(22πin)mBn(0)j=1m2j1(2πin)jΩmj+1=j=1m2j1(2πin)jΩmj+1.

Case 2: n=0.

B0(m)=01βm(x)dx=12Ωm+1.

βm(x), (m1) is piecewise C. Moreover, βm(x) is continuous for those positive integers m with Ωm=0 and discontinuous with jump discontinuities at integers for those positive integers m with Ωm0.

Assume first that m is a positive integer with Ωm=0. Then βm(0)=βm(1). Thus βm(x) is piecewise C and continuous. Hence the Fourier series of βm(x) converges uniformly to βm(x), and

βm(x)=12Ωm+1+n=n0(j=1m2j1(2πin)jΩmj+1)e2πinx=12Ωm+1+j=1m2j1j!Ωmj+1(j!n=n0e2πinx(2πin)j)=12Ωm+1+j=2m2j1j!Ωmj+1Bj(x)+Ωm×{B1(x),for xZ,0,for xZ.

Now, we can state our first result.

Theorem 3.1

For each positive integer l, we let

Ωl=k=1l1k!(lk)!bkBlk(r+1)+2k=0l11k!(lk)!bkBlk1(r)1l!Bl1(r).

Assume that Ωm=0 for a positive integer m. Then we have the following.

  1. k=0m1k!(mk)!bk(x)Bmk(r+1)(x) has the Fourier series expansion
    k=0m1k!(mk)!bk(x)Bmk(r+1)(x)=12Ωm+1+n=n0(j=1m2j1(2πin)jΩmj+1)e2πinx,
    for all xR, where the convergence is uniform.
  2. k=0m1k!(mk)!bk(x)Bmk(r+1)(x)=12Ωm+1+j=2m2j1j!Ωmj+1Bj(x),
    for all xR, where Bj(x) is the Bernoulli function.

Assume next that Ωm0 for a positive integer m. Then βm(0)βm(1). So βm(x) is piecewise C and discontinuous with jump discontinuities at integers. The Fourier series of βm(x) converges pointwise to βm(x), for xZ, and converges to

12(βm(0)+βm(1))=βm(0)+12Ωm,

for xZ.

Now, we can state our second theorem.

Theorem 3.2

For each positive integer l, we let

Ωl=k=1l1k!(lk)!bkBlk(r+1)+2k=0l11k!(lk)!bkBlk1(r)1l!Bl1(r).

Assume that Ωm0 for a positive integer m. Then we have the following.

  1. 12Ωm+1+n=n0(j=1m2j1(2πin)jΩmj+1)e2πinx={k=0m1k!(mk)!bk(x)Bmk(r+1)(x),for xZ,k=0m1k!(mk)!bkBmk(r+1)+12Ωm,for xZ.
  2. 12Ωm+1+j=1m2j1j!Ωmj+1Bj(x)=k=0m1k!(mk)!bk(x)Bmk(r+1)(x),for xZ;12Ωm+1+j=2m2j1j!Ωmj+1Bj(x)=k=0m1k!(mk)!bkBmk(r+1)+12Ωm,for xZ.

Fourier series of functions of the third type

Let

γm(x)=k=1m11k(mk)bk(x)Bmk(r+1)(x),

where r,m are integers with m2. Then we will consider the function

γm(x)=k=1m11k(mk)bk(x)Bmk(r+1)(x),

defined on R, which is periodic with period 1.

The Fourier series of γm(x) is

n=Cn(m)e2πinx,

where

Cn(m)=01γm(x)e2πinxdx=01γm(x)e2πinxdx.

Before proceeding further, we need to observe the following.

γm(x)=k=1m11mkbk1(x)Bmk(r+1)(x)+k=1m11kbk(x)Bmk1(r+1)(x)=k=0m21mk1bk(x)Bmk1(r+1)(x)+k=1m11kbk(x)Bmk1(r+1)(x)=k=1m2(1mk1+1k)bk(x)Bmk1(r+1)(x)+1m1Bm1(r+1)(x)+1m1bm1(x)=(m1)γm1(x)+1m1Bm1(r+1)(x)+1m1bm1(x).

From this, we see that

(1m(γm+1(x)1m(m+1)Bm+1(r+1)(x)1m(m+1)bm+1(x)))=γm(x),

and

01γm(x)dx=1m[γm+1(x)1m(m+1)Bm+1(r+1)(x)1m(m+1)bm+1(x)]01=1m(γm+1(1)γm(0)1m(m+1)(Bm+1(r+1)(1)Bm+1(r+1)(0))1m(m+1)(bm+1(1)bm+1(0)))=1m(γm+1(1)γm+1(0)1m(m+1)Bm(r)1m(m+1)bm+1).

For m2, we let

Λm=γm(1)γm(0)=k=1m11k(mk)(bk(1)Bmk(r+1)(1)bkBmk(r+1))=k=1m11k(mk)((2bkδk,0)(Bmk(r+1)+Bmk1(r))bkBmk(r+1))=k=1m11k(mk)bkBmk(r+1)+2k=1m11k(mk)bkBmk1(r).

Then

γm(0)=γm(1)Λm=0,

and

01γm(x)dx=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1).

Now, we would like to determine the Fourier coefficients Cn(m).

Case 1: n0. For this computation, we need to know the following:

01Bl(r+1)(x)e2πinxdx={k=1l(l)k1(2πin)kBlk(r),for n0,1l+1Bl(r),for n=0,01bl(x)e2πinxdx={k=1l(l)k1(2πin)kblk+1,for n0,1l+1bl+1,for n=0,Cn(m)=01γm(x)e2πinxdxCn(m)=12πin[γm(x)e2πinx]01+12πin01γm(x)e2πinxdxCn(m)=12πin(γm(1)γm(0))Cn(m)=+12πin01((m1)γm1(x)+1m1Bm1(r+1)(x)+1m1bm1(x))e2πinxdxCn(m)=m12πinCn(m1)12πinΛm+12πin(m1)01Bm1(r+1)(x)e2πinxdxCn(m)=+12πin(m1)01bm1(x)e2πinxdxCn(m)=m12πinCn(m1)12πinΛm12πin(m1)Θm12πin(m1)Φm,

where

Λm=γm(1)γm(0)Λm=k=1m11k(mk)bkBmk(r+1)+2k=1m11k(mk)bkBmk1(r),Θm=k=1m1(m1)k1(2πin)kBmk1(r),Φm=k=1m1(m1)k1(2πin)kbmk.Cn(m)=m12πinCn(m1)12πinΛm12πin(m1)Θm12πin(m1)ΦmCn(m)=m12πin(m22πinCn(m2)12πinΛm112πin(m2)Θm112πin(m2)Φm1)Cn(m)=12πinΛm12πin(m1)Θm12πin(m1)ΦmCn(m)=(m1)2(2πin)2Cn(m2)j=12(m1)j1(2πin)jΛmj+1Cn(m)=j=12(m1)j1(2πin)j(mj)Θmj+1j=12(m1)j1(2πin)j(mj)Φmj+1Cn(m)=Cn(m)=j=1m1(m1)j1(2πin)jΛmj+1j=1m1(m1)j1(2πin)j(mj)Θmj+1j=1m1(m1)j1(2πin)j(mj)Φmj+1.

We note here that

j=1m1(m1)j1(2πin)j(mj)Φmj+1=j=1m1(m1)j1(2πin)j(mj)k=1mj(mj)k1(2πin)kbmjk+1=j=1m1k=1mj(m1)j+k2(2πin)j+k(mj)bmjk+1=j=1m11mjk=1mj(m1)j+k2(2πin)j+kbmjk+1=j=1m11mjs=j+1m(m1)s2(2πin)sbms+1=s=2m(m1)s2(2πin)sbms+1j=1s11mj=s=1m(m1)s2(2πin)sbms+1(Hm1Hms)=1ms=1m(m)s(2πin)sHm1Hmsms+1bms+1.

Putting everything together, we get

Cn(m)=1ms=1m(m)s(2πin)s{Λms+1+Hm1Hmsms+1(Bms(r)+bms+1)}.

Case 2: n=0.

C0(m)=01γm(x)dx=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1).

γm(x), m2 is piecewise C. Moreover, γm(x) is continuous for those integers m2 with Λm=0 and discontinuous with jump discontinuities at integers for those integers m2 with Λm0.

Assume first that Λm=0. Then γm(0)=γm(1). Thus γm(x) is piecewise C and continuous. Hence the Fourier series of γm(x) converges uniformly to γm(x), and

γm(x)=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1)+n=n0{1ms=1m(m)s(2πin)s(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))}e2πinx=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1)+1ms=1m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))(s!n=n0e2πinx(2πin)s)=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1)+1ms=2m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x)+Λm×{B1(x),for xZ,0,for xZ=1ms=0s1m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x)+Λm×{B1(x),for xZ,0,for xZ.

Now, we can state our first result.

Theorem 4.1

For each integer l2, we let

Λl=k=1l11k(lk)bkBlk(r+1)+2k=1l11k(lk)bkBlk1(r),

with Λ1=0. Assume that Λm=0 for an integer m2. Then we have the following.

  1. k=1m11k(mk)bk(x)Bmk(r+1)(x) has Fourier series expansion
    k=1m11k(mk)bk(x)Bmk(r+1)(x)=1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1)+n=n0{1ms=1m(m)s(2πin)s(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))}e2πinx,
    for all xR, where the convergence is uniform.
  2. k=1m11k(mk)bk(x)Bmk(r+1)(x)=1ms=0s1m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x),
    for all xR, where Bs(x) is the Bernoulli function.

Assume next that m is an integer ≥2 with Λm0. Then γm(0)γm(1). Hence γm(x) is piecewise C and discontinuous with jump discontinuities at integers. Then the Fourier series of γm(x) converges pointwise to γm(x), for xZ, and converges to

12(γm(0)+γm(1))=γm(0)+12Λm=k=1m11k(mk)bkBmk(r+1)+12Λm,

for xZ.

Now, we can state our second result.

Theorem 4.2

For each integer l2, let

Λl=k=1l11k(lk)bkBlk(r+1)+2k=1l11k(lk)bkBlk1(r),

with Λ1=0. Assume that Λm0 for an integer m2. Then we have the following.

  1. =1m(Λm+11m(m+1)Bm(r)1m(m+1)bm+1)+n=n0{1ms=1m(m)s(2πin)s(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))}e2πinx={k=1m11k(mk)bk(x)Bmk(r+1)(x),for xZ,k=1m11k(mk)bkBmk(r+1)+12Λm,for xZ.
  2. 1ms=0m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x)=k=1m11k(mk)bk(x)Bmk(r+1)(x),for xZ;1ms=0s1m(ms)(Λms+1+Hm1Hmsms+1(Bms(r)+bms+1))Bs(x)=k=1m11k(mk)bkBmk(r+1)+12Λm,for xZ.

Results and discussion

In this paper, we study three types of sums of products of ordered Bell and poly-Bernoulli functions and derive their Fourier series expansion. In addition, we express those functions in terms of Bernoulli functions. The Fourier series expansion of the ordered Bell and poly-Bernoulli functions are useful in computing the special values of the poly-zeta and multiple zeta function. For details, one is referred to [3, 718]. It is expected that the Fourier series of the ordered Bell functions will find some applications in connection with a certain generalization of the Euler zeta function and the higher-order generalized Frobenius-Euler numbers and polynomials.

Conclusion

In this paper, we considered the Fourier series expansion of the ordered Bell and poly-Bernoulli functions which are obtained by extending by periodicity of period 1 the ordered Bell and poly-Bernoulli polynomials on [0,1). The Fourier series are explicitly determined.

Acknowledgements

The first author has been appointed a chair professor at Tianjin Polytechnic University by Tianjin City in China from August 2015 to August 2019.

Footnotes

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally to the manuscript and typed, read, and approved the final manuscript.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Taekyun Kim, Email: tkkim@kw.ac.kr.

Dae San Kim, Email: dskim@sogang.ac.kr.

Dmitry V Dolgy, Email: dvdolgy@gmail.com.

Jin-Woo Park, Email: a0417001@knu.ac.kr.

References

  • 1.Abramowitz M, Stegun IA. Handbook of Mathematical Functions. New York: Dover; 1970. [Google Scholar]
  • 2.Bayad A, Hamahata Y. Multiple polylogarithms and multi-poly-Bernoulli polynomials. Funct. Approx. Comment. Math. 2012;46:45–61. doi: 10.7169/facm/2012.46.1.4. [DOI] [Google Scholar]
  • 3.Dolgy DV, Kim DS, Kim T, Mansour T. Degenerate poly-Bernoulli polynomials of the second kind. J. Comput. Anal. Appl. 2016;21(5):954–966. [Google Scholar]
  • 4.Cayley A. On the analytical forms called trees, second part. Philos. Mag. Ser. IV. 1859;18(121):374–378. [Google Scholar]
  • 5.Comtet L. Advanced Combinatorics, the Art of Finite and Infinite Expansions. Dordrecht: Reidel; 1974. p. 228. [Google Scholar]
  • 6.Jang G-W, Kim DS, Kim T, Mansour T. Fourier series of functions related to Bernoulli polynomials. Adv. Stud. Contemp. Math. 2017;27(1):49–62. [Google Scholar]
  • 7.Khan WA. A note on degenerate Hermite poly-Bernoulli numbers and polynomials. J. Class. Anal. 2016;8(1):65–76. doi: 10.7153/jca-08-06. [DOI] [Google Scholar]
  • 8. Kim, T, Kim, DS: Some formulas of ordered Bell numbers and polynomials arising from umbral calculus (submitted)
  • 9.Kim DS, Kim T. A note on poly-Bernoulli and higher-order poly-Bernoulli polynomials. Russ. J. Math. Phys. 2015;22(1):26–33. doi: 10.1134/S1061920815010057. [DOI] [Google Scholar]
  • 10.Kim DS, Kim T. Higher-order Bernoulli and poly-Bernoulli mixed type polynomials. Georgian Math. J. 2015;22(2):265–272. doi: 10.1515/gmj-2015-0003. [DOI] [Google Scholar]
  • 11.Kim DS, Kim T. A note on degenerate poly-Bernoulli numbers and polynomials. Adv. Differ. Equ. 2015;2015 doi: 10.1186/s13662-015-0595-3. [DOI] [Google Scholar]
  • 12. Kim, DS, Kim, T: Fourier series of higher-order Euler functions and their applications. Bull. Korean Math. Soc. (to appear)
  • 13.Kim DS, Kim T, Mansour T, Seo J-J. Fully degenerate poly-Bernoulli polynomials with a q parameter. Filomat. 2016;30(4):1029–1035. doi: 10.2298/FIL1604029K. [DOI] [Google Scholar]
  • 14.Kim T, Kim DS. Fully degenerate poly-Bernoulli numbers and polynomials. Open Math. 2016;14:545–556. [Google Scholar]
  • 15. Kim, T, Kim, DS, Jang, G-W, Kwon, J: Fourier series of sums of products of Genocchi functions and their applications. J. Nonlinear Sci. Appl. (to appear)
  • 16.Kim T, Kim DS, Rim S-H, Dolgy D-V. Fourier series of higher-order Bernoulli functions and their applications. J. Inequal. Appl. 2017;2017(2017) doi: 10.1186/s13660-016-1282-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17.Knopfmacher A, Mays ME. A survey of factorization counting functions. Int. J. Number Theory. 2005;1(4):563–581. doi: 10.1142/S1793042105000315. [DOI] [Google Scholar]
  • 18.Mansour T. Combinatorics of Set Partitions. London: Chapman & Hall; 2012. [Google Scholar]
  • 19.Marsden JE. Elementary Classical Analysis. New York: Freeman; 1974. [Google Scholar]
  • 20.Mor M, Fraenkel AS. Cayley permutations. Discrete Math. 1984;48(1):101–112. doi: 10.1016/0012-365X(84)90136-5. [DOI] [Google Scholar]
  • 21. Zill, DG, Cullen, MR: Advanced Engineering Mathematics, Jones & Bartlett (2006)

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES