• Non ci sono risultati.

# Generalized higher order Bernoulli number pairs and generalized Stirling number pairs

N/A
N/A
Protected

Condividi "Generalized higher order Bernoulli number pairs and generalized Stirling number pairs"

Copied!
20
0
0

Testo completo

(1)

Contents lists available atScienceDirect

## Journal of Mathematical Analysis and Applications

www.elsevier.com/locate/jmaa

Generalized higher order Bernoulli number pairs and generalized Stirling number pairs

Weiping Wang

Department of Mathematics, Nanjing University, Nanjing 210093, PR China

a r t i c l e i n f o a b s t r a c t

Article history:

Received 20 February 2009 Available online 12 October 2009 Submitted by B. Bongiorno Keywords:

Generalized higher order Bernoulli numbers Generalized Stirling numbers

Delta series

Combinatorial identities

From a delta series f(t)and its compositional inverse g(t), Hsu deﬁned the generalized Stirling number pair(ˆS(n,k),ˆs(n,k)). In this paper, we further deﬁne from f(t)and g(t) the generalized higher order Bernoulli number pair (Bˆ(nz),bˆ(nz)). Making use of the Bell polynomials, the potential polynomials as well as the Lagrange inversion formula, we give some explicit expressions and recurrences of the generalized higher order Bernoulli numbers, present the relations between the generalized higher order Bernoulli numbers of both kinds and the corresponding generalized Stirling numbers of both kinds, and study the relations between any two generalized higher order Bernoulli numbers. Moreover, we apply the general results to some special number pairs and obtain series of combinatorial identities. It can be found that the introduction of generalized Bernoulli number pair and generalized Stirling number pair provides a uniﬁed approach to lots of sequences in mathematics, and as a consequence, many known results are special cases of ours.

## 1. Introduction

The Stirling numbers of both kinds and the Bernoulli numbers of both kinds are among the most interesting and impor- tant sequences in mathematics and have numerous applications in combinatorics, number theory, numerical analysis, and other ﬁelds. The Stirling number pair is

(

S

(

n

,

k

),

s

(

n

,

k

))

, where s

(

n

,

k

)

andS

(

n

,

k

)

are the Stirling numbers of the ﬁrst and second kinds. Analogously, the Bernoulli number pair is

(

Bn

,

bn

)

, whereBn andbnare the Bernoulli numbers of the ﬁrst and second kinds. In this paper, we will make a systematical study on various number pairs analogous to the Stirling number pair and the Bernoulli number pair.

Let

f

(

t

) =

i=0 fiti

i

!

be a formal power series, then the order o

(

f

(

t

))

of f

(

t

)

is the smallest integer k for which the coeﬃcient of tk does not vanish. As showed in [15, Section 1.12], the series f

(

t

)

has a compositional inverse, denoted by ¯f

(

t

)

and satisfying

f

(

¯f

(

t

))

= ¯f

(

f

(

t

))

=t, if and only ifo

(

f

(

t

))

=1. We call any series witho

(

f

(

t

))

Given a delta series f

(

t

)

=

i=1fiti

/

i! and its compositional inverse g

(

t

)

=

i=1giti

/

i!, Hsu [21,22] introduced the generalized Stirling number pair

S

(

n

,

k

),

ˆs

(

n

,

k

))

, where Sˆ

(

n

,

k

)

andˆs

(

n

,

k

)

are deﬁned by the following generating functions:

doi:10.1016/j.jmaa.2009.10.023

(2)

1 k

!

f

(

t

)

k

=

n=k

ˆ

S

(

n

,

k

)

t

n

n

!

and 1 k

!

g

(

t

)

k

=

n=k

ˆ

s

(

n

,

k

)

t

n

n

! .

(1.1)

We may callˆs

(

n

,

k

)

andSˆ

(

n

,

k

)

thegeneralized Stirling numbers of the ﬁrst and second kinds.

Let f

(

t

)

=et1 and g

(

t

)

=log

(

1+t

)

, then the pair turns to the classical Stirling number pair

(

S

(

n

,

k

),

s

(

n

,

k

))

. Let f

(

t

)

=t

/(

1−t

)

andg

(

t

)

=t

/(

1+t

)

, then the pair turns to n

1 k

1 n

!

k

! , ( −

1

)

nk n

1

k

1 n

!

k

!

,

wheren1

k1

n!

k! are the Lah numbers (see [15, Section 3.3]). Various special generalized Stirling number pairs can be found in Hsu’s papers [21,22]. The readers are also referred to [19,37,39,40] for more results on generalized Stirling number pairs.

Note that the generalized Stirling numbers deﬁned above, say Sˆ

(

n

,

k

)

, can be viewed as the elements of the exponential Riordan array

(

1

,

f

(

t

))

or of the iteration matrix associated with f

(

t

)

. The theory of Riordan arrays can be found in the papers of Shapiro, Sprugnoli, et al. [30,31], and the results on the iteration matrix can be found in Comtet’s book [15, Sec- tion 3.7]. Close relations between Riordan arrays, iteration matrices, Sheffer sequences, binomial sequences and generalized Stirling number pairs are demonstrated explicitly in [19,37].

On the other hand, for the delta series f

(

t

)

and its compositional inverseg

(

t

)

given above, we can deﬁne thegeneralized higher order Bernoulli number pair

(

Bˆ(nz)

,

bˆ(nz)

)

, where Bˆ(nz)andbˆn(z)satisfy the following generating functions: f1t f

(

t

)

z

=

n=0

B

ˆ

(nz)tn n

!

and g1t g

(

t

)

z

=

n=0

b

ˆ

(nz)tn

n

! .

(1.2)

The numbers Bˆn(z) andbˆ(nz) may be called thegeneralized higher order Bernoulli numbers of the ﬁrst and second kinds, or more explicitly, the higher order Bernoulli numbers of the ﬁrst and second kinds associated with the delta series f

(

t

)

. Additionally, the numbers Bˆn:= ˆBn(1)andbˆn:= ˆbn(1)may be called thegeneralized Bernoulli numbers of the ﬁrst and second kinds.

Within our knowledge, Carlitz [8,9] was the ﬁrst to seriously consider generalized (higher order) Bernoulli numbers and he was mainly interested in arithmetic properties of them. Clarke [14] and Adelberg [2] introduced respectively the universal Bernoulli numbers B˜n and the higher order universal Bernoulli numbersB˜(nz). Let the “universal” power seriesF

(

t

)

be deﬁned by F

(

t

)

:=t+

i=1citi+1

/(

i+1

)

wherec1

,

c2

, . . .

are indeterminates, and letG

(

t

)

:= ¯F

(

t

)

be the compositional inverse. Then B˜n andB˜(nz)are deﬁned by

t G

(

t

) =

n=0

B

˜

n

tn n

!

and t G

(

t

)

z

=

n=0

B

˜

(nz)tn n

! .

From the deﬁnitions, it is clear that the (higher order) universal Bernoulli numbers are essentially the generalized (higher order) Bernoulli numbers. For more results on universal Bernoulli numbers, the readers may consult [3,4,34,35].

If f

(

t

)

=et1 and g

(

t

)

=log

(

1+t

)

, then the corresponding Bernoulli number pair is

(

B(nz)

,

b(nz)

)

. The B(nz)are just the classical higher order Bernoulli numbers, which are also called Nörlund polynomials [27, Chapter 6] (see, e.g., [1,11,25] for various properties). Setting z=1 gives the famous Bernoulli numbers (of the ﬁrst kind). Theb(nz)are called the higher order Bernoulli numbers of the second kind and thebn:=b(n1) are the Bernoulli numbers of the second kind. Some care must be taken here because the (higher order) Bernoulli numbers of the second kind are frequently deﬁned asbn

/

n!(or correspond- ingly, b(nz)

/

n!) (see, e.g., [24, pp. 265–287] and [10,20,25]). Our deﬁnition of bˆ(nz) coincides with Roman’s [29, Section 3.2]

and will bring us more convenience.

Now, given two delta series f

(

t

)

andg

(

t

)

with f

(

g

(

t

))

=g

(

f

(

t

))

=t, we have two pairs S

ˆ (

n

,

k

), ˆ

s

(

n

,

k

)

and

B

ˆ

(nz)

,

b

ˆ

n(z)

.

Since there are many studies on generalized Stirling number pairs, in this paper, we give emphasis to generalized higher order Bernoulli number pairs.

In Section 2, we show that the generalized Stirling numbers and the generalized higher order Bernoulli numbers are essentially the Bell polynomials and the potential polynomials. Section 3 gives some special generalized Stirling number pairs and the corresponding generalized higher order Bernoulli number pairs. Sections 4 and 5 are devoted to the expres- sions and recurrences of the generalized higher order Bernoulli numbers. Sections 6 and 7 present some relations between the generalized higher order Bernoulli numbers of both kinds and the corresponding generalized Stirling numbers of both kinds. Finally, in Section 8, we establish the relations between any two generalized higher order Bernoulli numbers. It can be found that the study of generalized higher order Bernoulli number pairs and generalized Stirling number pairs provides a uniﬁed approach to many sequences in combinatorics. As a consequence, many results obtained before are special cases of ours.

(3)

## 2. Bell polynomials and potential polynomials

Essentially, the generalized Stirling numbers and the generalized higher order Bernoulli numbers deﬁned in Section 1 are the Bell polynomials and the potential polynomials, respectively.

Theexponential partial Bell polynomials[15, pp. 133 and 134] are the polynomials Bn,k

=

Bn,k

(

x1

,

x2

, . . .)

in an inﬁnite number of variablesx1

,

x2

, . . . ,

deﬁned by the series expansion:

1 k

!

m=1 xmtm

m

!

k

=

n=k

Bn,ktn

n

! ,

k

=

0

,

1

,

2

, . . . .

Their exact expression is Bn,k

(

x1

,

x2

, . . .) =

σ(n,k) n

!

c1

!

c2

! · · ·

x1

1

!

c1

x2

2

!

c2

· · · ,

(2.1)

where the summation takes place over the set

σ (

n

,

k

)

of all partitions of n into k parts, that is, over all integers c1

,

c2

,

c3

, . . .

0, such that c1+2c2+3c3+ · · · =n and c1+c2+c3+ · · · =k. Thus, the generalized Stirling numbers, saySˆ

(

n

,

k

)

, are equal toBn,k

(

f1

,

f2

, . . .)

.

Let f

(

t

)

:=

i=1fiti

/

i!be a generic delta series. For each complex numberz, deﬁne thepotential polynomials P(nz)by 1

+

n=1 Pn(z)tn

n

! =

1

+

i=1

fiti i

!

z

.

Denote P(0z):=1, then according to [15, p. 141, Theorem B], we have Pn(z)

=

Pn(z)

(

f1

,

f2

, . . . ,

fn

) =

n k=0

(

z

)

kBn,k

(

f1

,

f2

, . . .).

(2.2)

By the deﬁnition of the potential polynomials, it can be found that B

ˆ

(nz)

=

tn n

!

f1t f

(

t

)

z

=

tn

n

!

1

+

i=1

fi+1

(

i

+

1

)

f1

ti i

!

z

=

Pn(z) f2

2f1

,

f3 3f1

, . . .

,

(2.3)

where[tn

/

n!]H

(

t

)

=n![tn]H

(

t

)

and[tn]H

(

t

)

is the coeﬃcient oftn in the power seriesH

(

t

)

.

## 3. Some special number pairs

In this section, we give some special number pairs. Each of the pairs is related to a delta series f

(

t

)

and its compositional inverse ¯f

(

t

)

. For clarity, these pairs are listed in Table 1.

As showed in Section 1, the classical Stirling number pair

(

S

(

n

,

k

),

s

(

n

,

k

))

and the classical higher order Bernoulli number pair

(

Bn(z)

,

b(nz)

)

construct an example. They correspond to the delta serieset1 and log

(

1+t

)

, and are given by entries (A1) and (A2) of Table 1.

In [12], Carlitz deﬁned the degenerate Stirling numbers of the second kind S

(

n

,

k|

λ)

and the higher order degenerate Bernoulli numbers of the ﬁrst kind

β

n(z)

(λ)

, by means of

1 k

!

(

1

+ λ

t

)

1λ

1k

=

n=k

S

(

n

,

k

|λ)

tn n

!

and

t

(

1

+ λ

t

)

1λ

1 z

=

n=0

β

n(z)

(λ)

t

n

n

! ,

respectively. These give us entry (B1). The compositional inverse of

(

1+

λ

t

)

11 is

((

1+t

)

λ1

)/λ

, from which we can obtain entry (B2). It is obvious that when

λ

→0, (B1) and (B2) will reduce to (A1) and (A2), respectively.

Entries (E1), (E2), (F1), (F2), (G1) and (G2) are in fact special cases of (B1) and (B2). However, they are of particular interest.

(4)

Table 1

Several generalized higher order Bernoulli number pairs and the corresponding generalized Stirling number pairs.

f(t) ¯f(t) ˆS(n,k)orˆs(n,k) Bˆ(nz)orbˆ(nz)

(A1) et1 S(n,k) B(nz)

(A2) log(1+t) s(n,k) b(nz)

(B1) (1+λt)1λ1 S(n,k|λ) βn(z)(λ)

(B2) (1+tλ)λ1 s(n,k|λ)=λnkS(n,k|1λ) α(nz)(λ)=λnβn(z)(1λ)

(C1) tet n

k

knk (z)n

(C2) (tet)1 (1)nkn1

k1

nnk z(zn)n1

(D1) 2 sinh2t T(n,k)=n

k

B(nkk)(k2) B(nz)(2z)

(D2) 2 arcsinh2t t(n,k)=n1

k1

B(nn)k(n2) nzzBn(nz)(n2z) ifz=n; Bnifz=n,nis even;

0 ifz=n,nis odd

(E1) 1tt L(n,k)=n1

k1

n!

k! (1)n(z)n=βn(z)(1)

(E2) 1t+t (1)nkn1

k1

n!

k! (z)n=(1)nβn(z)(1)

(F1) tt2 (1)nk nk!!k

nk

zn=(4)nβ(nz)(12)

(F2) 1

14t 2

(n1)!

(k1)!2nk1 n1

z(n1)!2nz1

n1

=(2)nβn(z)(2)

(G1) 2t+t2 nk!!

k nk

22kn (2zn)n=2nβn(z)(12)

(G2)

1+t1 (1)nk((nk11)!)!2nk1 n1

1 22nk

(1)n1(n1)!z 4n

2nz1 n1

=2nβn(z)(2)

With some computation, we can verify entries (E1) and (E2), which are the

λ

= −1 case of (B1) and (B2). Note that the generalized Stirling number pair is now

(

L

(

n

,

k

), (

1

)

nkL

(

n

,

k

))

, where L

(

n

,

k

)

=n1

k1

n!

k! are the Lah numbers. The corresponding generalized higher order Bernoulli number pair is

((

1

)

n

(

z

)

n

, (

z

)

n

)

, where

(

z

)

n are the falling factorials [15, p. 6, Eq. (4f)] deﬁned by

(

z

)

0=1 and

(

z

)

n=z

(

z1

)

· · ·(zn+1

)

forn1.

Entry (F1) can be obtained directly. Note that zn are the rising factorials [15, p. 6, Eq. (4g)] deﬁned by z0 = 1 and zn =z

(

z+1

)

· · ·

(

z+n1

)

for n1. To obtain entry (F2), we may use the Lagrange inversion formula [15, Section 3.8, Theorems A and B]:

Lemma 3.1(The Lagrange inversion formula). Let f

(

t

)

be a delta series and ¯f

(

t

)

be the corresponding compositional inverse, then for any formal power series

Φ(

t

)

we have

Φ ¯

f

(

t

)

= Φ(

0

) +

n=1

tn n

tn1

Φ

(

t

)

f

(

t

)

t n

.

Equivalently, for positive integer n we have

tn

Φ ¯

f

(

t

)

=

1 n tn1

Φ

(

t

)

f

(

t

)

t n

.

(3.1)

Particularly, if

Φ(

t

)

=tk, where k is a nonnegative integer, then(3.1)reduces to tn

¯

f

(

t

)

k

=

k n tnkf

(

t

)

t n

.

(3.2)
(5)

By appealing to (3.1) and (3.2), we derive fornk1 that

ˆ

s

(

n

,

k

) =

tn

n

!

1

k

!

1

− √

1

4t 2 k

=

n

!

k

!

k n tnkt

t2 t n

= (

n

1

) ! (

k

1

)!

2n

k

1 n

1

,

and forn1 that b

ˆ

(nz)

=

tn n

!

2t 1

− √

1

4t z

= −

z nn

!

tn1

(

1

t

)

z1n

= −

z nn

!

2n

z

1 n

1

.

Thus, entry (F2) is obtained (see also [15, Exercise 3.21(2)]). As a by-product, we have 1

n

!

b

ˆ

n(1)

=

1 n

+

1 2n n

=

Cn

,

whereCn are the famous Catalan numbers [18, p. 203].

In a similar way, entries (G1) and (G2) can be veriﬁed. Note that the generalized Stirling numbers given by (G1) and (G2) can be found in [15, Exercise 3.7].

Entry (C1) can be obtained directly, and entry (C2) can be veriﬁed by means of the Lagrange inversion formula. Note that Sˆ

(

n

,

k

)

=n

k

knkin (C1) are the idempotent numbers (see [15, p. 135, Theorem B]), and|ˆs

(

n

,

k

)

| =n1

k1

nnkin (C2) are the numbers of planted forests withkcomponents on the vertex set[n](see [33, Section 5.3]).

Finally, let us verify entries (D1) and (D2). The generalized Stirling numbersT

(

n

,

k

)

andt

(

n

,

k

)

are called central factorial numbers, which were studied systematically by Butzer and his cooperators [6,7]. As evaluated by Mathematical Reviews,

“the central factorial numbers are at least as important as Stirling’s numbers, if judged by their performance in expansions”.

To obtain the explicit expression ofT

(

n

,

k

)

, note that sinht=

(

etet

)/

2, then T

(

n

,

k

) =

tn n

!

1 k

!

2 sinht

2

k

=

tn

n

!

1

k

!

e2t

e2tk

=

n

!

k

!

tnk t et

1 k

ek2t

=

n

k

B(nkk)

k 2

,

whereB(nz)

(

x

)

are the higher order Bernoulli polynomials deﬁned by (for details, see [26, Section 2.8] and [32, Section 1.6]) t et

1 z

ext

=

n=0

B(nz)

(

x

)

t

n

n

!

|

t

| <

2

π .

Similarly, we have Bˆn(z)=B(nz)

(

z

/

2

)

. By means of the Lagrange inversion formula, we can also ﬁnd that t

(

n

,

k

) =

n

1 k

1

B(nn)k

n

2

.

To obtainbˆn(z), more computation is required. According to the Lagrange inversion formula and the expansion cotht

=

cosht

sinht

=

1 t

+

n=1 22nB2n

(

2n

)!

t2n1 0

< |

t

| < π

of the hyperbolic cotangent [38], forn1 we obtain b

ˆ

(nz)

=

tn n

!

t 2 arcsinh2t z

= (

n

1

)!

tn1

d dt 2 sinht 2

t

z2 sinht 2

t

n

=

z tn1

(

n

1

)!

2 sinht 2

t

zn 1 2coth t

2

1 t

=

z tn1

(

n

1

) !

i=0 B(inz)

n

z 2 ti i

!

j=1

B2jt2j1

(

2j

) !

=

z tn1

(

n

1

)!

l=2 l2

i=0

l i

B(inz)

n

z

2

Bli tl1 l

!

=

z n tn n

!

l=2 Bl(nz+1) n

z 2

+

l

2Bl(n1z)

n

z

2

B(lnz) n

z

2

tl

l

! .

(6)

Therefore,bˆ(1z)=0 and b

ˆ

(nz)

=

z

n

B(nnz+1)

n

z

2

+

n 2B(nn1z) n

z 2

Bn(nz) n

z 2

forn2. Since (see [29, Eq. (4.2.7)]) B(na+1)

(

x

) =

1

n

a

B(na)

(

x

) +

n x

a

1

B(na)1

(

x

) (

a

=

0

),

then forn2, we havebˆ(nz)=nzzB(nnz)

(

n2z

)

ifz=nandbˆ(nz)=Bn ifz=n. Making use of the facts that B(1z)

(

2z

)

=0 and Bn=0 whenn=3

,

5

,

7

, . . . ,

we can obtain the ﬁnal result.

In the following sections, we will study the properties of the generalized higher order Bernoulli numbers and the rela- tions between the generalized higher order Bernoulli numbers and the corresponding generalized Stirling numbers. We will also apply the general results obtained later to the special number pairs given in this section. All of these general results have dual forms by the substitutions Bˆ(nz)bˆn(z), Sˆ

(

n

,

k

)

ˆs

(

n

,

k

)

and fngn. However, for simplicity, most of the dual results will not be presented explicitly.

## 4. Expressions and recurrences

Theorem 4.1.For integer n1, we have the expression B

ˆ

(nz)

=

n

!

n k=0

σ(n,k)

z c1

,

c2

, . . . ,

cn f1k f2 2

!

c1 f3 3

!

c2

· · ·

fn+1

(

n

+

1

)!

cn

,

(4.1)

where z

c1,c2,...,cn

are the multinomial coeﬃcients deﬁned by

z c1

,

c2

, . . . ,

cn

= (−

z

)

c1+c2+···+cn

c1

!

c2

! · · ·

cn

! .

Proof. By appealing to Eqs. (2.2) and (2.3), we have B

ˆ

(nz)

=

n k=0

( −

z

)

kBn,k f2

2f1

,

f3 3f1

, . . .

=

n k=0

( −

z

)

kf1kBn,k f2

2

,

f3 3

, . . .

=

n k=0

σ(n,k)

(−

z

)

kf1kn

!

c1

!

c2

! · · ·

cn

!

f2 2

!

c1 f3 3

!

c2

· · ·

fn+1

(

n

+

1

) !

cn

,

which is just (4.1). 2

For example, the classical Bernoulli numbers Bnsatisfy Bn

=

n

!

n k=0

σ(n,k)

( −

1

)

k k c1

,

c2

, . . . ,

cn 1

2

!

c13

!

c2

· · · (

n

+

1

) !

cn

and the Bernoulli numbers of the second kindbnsatisfy bn

=

n

!

n k=0

σ(n,k)

( −

1

)

nk k c1

,

c2

, . . . ,

cn 1

2c13c2

· · · (

n

+

1

)

cn

.

Based on Theorem 4.1, the following special values of the generalized higher order Bernoulli numbers can be obtained without diﬃculty:

B

ˆ

(0z)

=

1

,

B

ˆ

(1z)

= −

f2

2f1z

,

B

ˆ

(2z)

=

f22 4f12z2

+

f22 4f12

f3

3f1

z

,

B

ˆ

(3z)

= −

f23 8f13z3

+

3f23 8f13

+

f2f3

2f12

z2

+

f23

4f13

+

f2f3 2f12

f4

4f1

z

.

Setting fn=1 and fn=

(−

1

)

n1

(

n1

)!

respectively, we can obtain some values of the classical higher order Bernoulli numbers of both kinds (see Liu and Srivastava’s paper [25]).
(7)

From the special values, it can be seen thatBˆ(nz)are polynomials inz. In fact, we have

n=0

B

ˆ

(nz)tn n

! =

f

(

t

)

f1t z

=

1

+

i=1 fi+1

(

i

+

1

)

f1 ti i

!

z

=

j=0

z j

i=1 fi+1

(

i

+

1

)

f1 ti i

!

j

.

Let

F

(

t

) =

i=1

fi+1

(

i

+

1

)

f1 ti i

! ,

then degtF

(

t

)

jj, which indicates that B

ˆ

(nz)

=

tn n

!

j=0

z j F

(

t

)

j

=

tn n

!

n j=0

z j F

(

t

)

j

.

Therefore,Bˆ(nz)are indeed polynomials inz of degree not greater thann. Moreover, since

znB

ˆ

n(z)

=

zntn

n

! −

z

n

F

(

t

)

n

=

zntn

n

! (−

z

)

n

n

!

f2

2f1

n

tn

=

f2 2f1 n

,

then we have degzBˆn(z)=nand[zn] ˆB(nz)=

(

f2

/(

2f1

))

n when f2=0.

We now determine the general coeﬃcients of Bˆn(z). Let

σ (

n

,

k

)

= [zk] ˆB(nz)for 0knand deﬁne the associated Stirling numbers A

(

n

,

k

)

related to the delta series f

(

t

)

by

1 k

!

f

(

t

) −

f1tk

=

n=2k

A

(

n

,

k

)

t

n

n

! ,

(4.2)

then the next theorem can be established.

Theorem 4.2.We have B

ˆ

(nz)

=

n k=0

σ (

n

,

k

)

zk and

σ (

n

,

k

) = (−

1

)

k n

j=k

f1j n

!

(

n

+

j

)!

s

(

j

,

k

)

A

(

n

+

j

,

j

),

(4.3)

where s

(

j

,

k

)

are the classical Stirling numbers of the ﬁrst kind and A

(

n

,

j

)

are the associated Stirling numbers deﬁned in(4.2).

Proof. Based on the generating functions ofBˆ(nz)and A

(

n

,

j

)

, it can be found that B

ˆ

(nz)

=

tn n

!

f1t f

(

t

)

z

=

tn

n

!

1

1

+

f11t

(

f

(

t

) −

f1t

)

z

=

tn

n

!

j=0

(−

1

)

j z

+

j

1 j f

(

t

) −

f1tj

f1jtj

=

tn

n

!

j=0

1 f1 j

(

z

+

j

1

)

j n=2j

A

(

n

,

j

)

t

nj

n

!

=

n

j=0

1 f1 j zjn

!

(

n

+

j

) !

A

(

n

+

j

,

j

).

Because (see [15, p. 213, Eq. (5f)])

zj

=

j k=0

( −

1

)

jks

(

j

,

k

)

zk

,

(8)

we have B

ˆ

(nz)

=

n j=0

1 f1 j

n

!

(

n

+

j

)!

A

(

n

+

j

,

j

)

j k=0

(−

1

)

jks

(

j

,

k

)

zk

=

n k=0

(−

1

)

k n j=k

f1j n

!

(

n

+

j

)!

s

(

j

,

k

)

A

(

n

+

j

,

j

)

zk

.

This completes the proof. 2

Similarly, let

τ (

n

,

k

)

= [zkb(nz)for 0knand deﬁne the associated Stirling numbersa

(

n

,

k

)

related to the delta series g

(

t

)

by

1 k

!

g

(

t

) −

g1tk

=

n=2k

a

(

n

,

k

)

t

n

n

! .

Then b

ˆ

(nz)

=

n k=0

τ (

n

,

k

)

zk

=

n k=0

( −

1

)

k n j=k

g1j n

!

(

n

+

j

) !

s

(

j

,

k

)

a

(

n

+

j

,

j

)

zk

Riferimenti

Documenti correlati