¨ MODIFIED NORLUND POLYNOMIALS ATUL DIXIT, ADAM KABZA, VICTOR H. MOLL, AND CHRISTOPHE VIGNAT ∗ considered by Zagier are genAbstract. The modified Bernoulli numbers Bn (`)∗ eralized to modified N¨ orlund polynomials Bn . For ` ∈ N, an explicit expression for the generating function for these polynomials is obtained. Evaluations of some spectacular integrals involving Chebyshev polynomials, and of a finite sum involving integrals of the Hurwitz zeta function are also obtained. New results about the `-fold convolution of the square hyperbolic secant distribution are obtained, such as a differential-difference equation satisfied by a logarithmic moment and a closed-form expression in terms of the Barnes zeta function.

1. Introduction The Bernoulli numbers, defined by the generating function (1.1)

∞ X

Bn

n=0

zn z = z , n! e −1

were extended by N. E. N¨ orlund [12, Ch. 6] to  α ∞ X z zn (1.2) Bn(α) = . n! ez − 1 n=0 (α)

orlund polynomials (these are Here α ∈ C. The coefficients Bn are called the N¨ (α) indeed polynomials in α). The list {Bn : n ≥ 0} begins with   α 1 1 1 (1.3) 1, − , α(3α − 1), − α2 (α − 1), α(15α3 − 30α2 + 5α + 2) . 2 12 8 240 For α ∈ N, the N¨ orlund polynomials are expressed as the α-fold convolutions of Bernoulli numbers. This follows from the recurrence n   X n (α−1) (α) (1.4) Bn = Bj Bn−j , for α ≥ 2, j j=0 (1)

obtained from (1.2), and the initial condition Bn = Bn . Zagier [16] introduced a modification of the Bernoulli numbers via  n  X n + r Br ∗ (1.5) Bn = , n ∈ N, 2r n+r r=0 Date: November 4, 2014. 1991 Mathematics Subject Classification. Primary 11B68, 33C45, Secondary 05A40, 65Q10. Key words and phrases. N¨ orlund polynomials, square hyperbolic secant distribution, logarithmic moments, Barnes zeta function, Chebyshev polynomials, Zagier polynomials. 1

2

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

and their polynomial version (1.6)

Bn∗ (x)

=

 n  X n + r Br (x) r=0

2r

n+r

,

was studied in detail in [7]. Here Bn (x) is the Bernoulli polynomial with the generating function ∞ X zexz zn (1.7) = z , Bn (x) n! e −1 n=0 and so along with (1.1), we have Bn = Bn (0). In particular, [7] establishes the formula ∞ X 1 1 (1.8) Bn∗ (x)z n = − log z − ψ(z + 1/z − 1 − x) 2 2 n=1 for the generating function of the Zagier polynomials Bn∗ (x), viewed as a formal power series. Here Γ0 (x) (1.9) ψ(x) = Γ(x) is the digamma function. The special case x = 0 yields ∞ X 1 1 (1.10) Bn∗ z n = − log z − ψ(z + 1/z − 1). 2 2 n=1 In the present work, the N¨orlund polynomials are modified in a similar way as Zagier’s. These modified N¨ orlund polynomials are defined here by  (α) n  X n + r Br (1.11) Bn(α)∗ := , n ∈ N. n+r 2r r=0 The Zagier modification of the Bernoulli numbers (1.5) is the special case α = 1. For α ∈ N, the main result of this paper is an expression for the generating function ∞ X (1.12) FB ∗ (z; α) = Bn(α)∗ z n , n=1

involving derivatives of the digamma function as given in Theorem 1.2. This is a generalization of (1.10). Notation. Standard notation is used throughout the paper. 1) The generalized binomial coefficients are defined by   x 1 = x(x − 1) · · · (x − n + 1), n n! for x ∈ R and n ∈ N. 2) The harmonic numbers are defined by 1 1 Hn = 1 + + · · · + . 2 n 3) The gamma function is defined by the integral representation Z ∞ e−t tz−1 dt Γ(z) = 0

¨ MODIFIED NORLUND POLYNOMIALS

3

for Re z > 0 and extended by analytic continuation. It satisfies the functional equation Γ(z + 1) = zΓ(z). 4) The digamma function ψ(z) is defined by ψ(z) =

d log Γ(z). dz

It satisfies 1 ψ(z + 1) = ψ(z) + . z 5) The Chebyshev polynomials of the first and second kind are defined, respectively, by their Binet representations [15] i p p 1h (x + x2 − 1)n + (x − x2 − 1)n (1.13) Tn (x) = 2 and h i p p 1 (1.14) Un (x) = √ (x + x2 − 1)n − (x − x2 − 1)n . 2 x2 − 1 The work presented here is based on the symbolic notation Z  π ∞ (1.15) g(x + B) = g x − 12 + iv sech2 (πv) dv. 2 −∞ The formula (1.15) is based on the fact that, if LB is a random variable with the square secant hyperbolic distribution π (1.16) ρ(x) = sech2 (πx), 2 then Z ∞ n n ρ(u) ıu − 12 du (1.17) Bn = E ıLB − 12 = −∞

so that, symbolically, with g(x) = xn , (1.18)

Bn = g(B).

This extends to Bernoulli polynomials as Bn (x) = (B + x)n = E x + ıLB −

(1.19)

 1 n 2

and to any analytic function g as (1.20)

 E g(x −

1 2

 π + iLB ) = 2

Z



g x− −∞

This is complemented with the notation Z (1.21) f (x + U ) =

1 2

 + iv sech2 (πv) dv.

1

f (x + u) du,

0

that corresponds to the average over a uniform distribution U on [0, 1]. The symbolic form (1.15) is a restatement of the umbral approach described in [7]. The classical umbral calculus begins with a sequence {an } and formally transforms it into powers an of a new variable a, named the umbra of {an }. The

4

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

original sequence is then recovered by the evaluation map eval{an } = an . The Bernoulli umbra, studied in [7], is defined by the generating function (1.22)

eval{exp (tB(x))} =

text et − 1

and it satisfies, with B = B(0), (1.23)

−B = B + 1, and (−B)n = Bn for n 6= 1,

and (1.24)

eval{B(x)} = eval{x + B}.

For more properties of Bernoulli umbrae, the reader is referred to Gessel [10]. Theorem 2.3 in [7] states that the Bernoulli umbra coincides with a random variable iLB − 21 , in the sense that,   (1.25) eval{g(B + x)} = E g(x − 12 + iLB ) , for all admissible functions g. Thus from (1.15), (1.20) and (1.25), one obtains the three equivalent notations   (1.26) g(x + B) = E g(x − 21 + iLB ) = eval{g(B(x))}, and for Now density density

brevity, we will mostly use the symbolic form g(x + B). take ` independent copies {LB1 , · · · , LB` } of the random variable LB . The ρ` (x) associated to L = LB1 + · · · LB` is then the `-fold convolution of the ρ(x) of each summand. This is computed by the recurrence Z ∞ (1.27) ρ` (x) = ρ`−1 (u)ρ1 (x − u) du, −∞

starting with ρ1 (x) = ρ(x). A direct computation of the densities {ρ` } is remarkably difficult. The case ` = 2 is presented in Section 4. The case ` = 1 and g(x) = log x of the formula Z ∞ (1.28) E[g(x − 2` + iLB1 + iLB2 + · · · + iLB` )] = ρ` (u)g(x − 2` + iu) du −∞

was used in [7] to evaluate the generating functions of the modified Bernoulli numbers and of Zagier polynomials. In the umbral notation, this quantity can be written as h  i (1.29) eval [g(x + B1 + · · · + B` )] = eval g B(`) (x) , so that the umbra associated with the modified N¨orlund polynomials is (1.30)

B(`) = B1 + B2 + · · · + B` .

This is extended here to compute the corresponding generating function of the modified N¨ orlund polynomials. A crucial step in the argument uses the following result which evaluates the logarithm of the umbra B(`) . Theorem 1.1. Let ` ∈ N be fixed. For x ∈ R,      d`−1 x−1 ` (`) ψ x− . eval{log B (x)} = −H`−1 + `−1 dx `−1 2   Here Hr is the harmonic number and ψ(x) is the digamma function and 2` denotes the floor function.

¨ MODIFIED NORLUND POLYNOMIALS

5

The following generating function for the modified N¨orlund polynomials is now obtained from the previous theorem. Theorem 1.2. Let ` ∈ N be fixed. The generating function FB ∗ (z; `) =

∞ X

Bn(`)∗ z n

n=1 (`)∗

for the modified N¨ orlund polynomials Bn is given by       x−1 ` 1 d`−1 1 ψ x− H`−1 − `−1 FB ∗ (z; `) = − log z + `−1 2 2 dx 2 evaluated at x = z + 1/z + ` − 2. An alternate representation for eval{log B(`) (x)} gives the following remarkable integral evaluation involving the density ρ` (x). Theorem 1.3. Let ` ∈ N be fixed. Then Z 0



log(1 + bu2 ) ρ` (u) du = − log x −

     d`−1 ` x−1 ` − H`−1 + `−1 ψ x− 2 dx 2 `−1

with b = (x − `/2)−2 . Theorems 1.2 and 1.3 readily give the following result. We record it as a theorem only to emphasize the link between the generating function of the modified N¨orlund polynomials and the definite integral containing the density ρ` (x). Theorem 1.4. Let ` ∈ N be fixed. The generating function FB ∗ (z; `) =

∞ X

Bn(`)∗ z n

n=1 (`)∗

for the modified N¨ orlund polynomials Bn is given by Z 1 1 ` 1 ∞ FB ∗ (z; `) = − log z − log x − − log(1 + bu2 )ρ` (u) du 2 2 2 2 0 with b = (x − `/2)−2 and x = z + 1/z + ` − 2. Section 2 describes a symbolic formalism based on two probability densities. This is used in Section 3 to obtain an expression for the generating function of the N¨ orlund polynomials. Section 4 presents a family of densities that provide an alternative form of this generating function. These densities satisfy a differentialdifference equation and the initial conditions are evaluated in Section 5. The last two sections uses the densities described above to evaluate some definite integrals involving Chebyshev polynomials and the Hurwitz zeta function. A direct evaluation of these examples seems out of the range of the current techniques of integration.

6

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

2. Some symbolic formalism The definition of the digamma function as ψ(z) = the evaluation Z 1 ψ(x + t) dt = log x. (2.1)

d dz

log Γ(z) immediately gives

0

The inversion formula (2.2)

ψ(x) =

π 2



Z

log(x − −∞

1 2

+ iu) sech2 πu du

was established in Theorem 2.5 of [7]. In the notation (1.21) and (1.15), (2.1) and (2.2) expresses the equivalence of the relations (2.3)

ψ(x + U ) = log x and ψ(x) = log(x + B).

This is now shown to be a particular case of a more general inversion formula. Definition 2.1. For real-valued functions f and g, define in recursive form f (x + U (`) ) = f (x + U + U (`−1) )

(2.4)

for ` ≥ 2,

with U (1) = U , and similarly g(x + B (`) ) = g(x + B + B (`−1) )

(2.5) with B

(1)

for ` ≥ 2,

= B.

In the lemma given below, this symbolic formalism is connected to anti-derivatives d` (`) F (x) = f (x), F (`) of the function f , defined as any function F (`) such that dx` via the classical forward difference operator ∆ defined by (2.6)

∆f (x) = f (x + 1) − f (x).

It is clear that if f is a polynomial of degree `, then ∆f (x) is also a polynomial and its degree is ` − 1. Lemma 2.2. Let F (`) be an antiderivative of f of order `. Then (2.7)

f (x + U (`) ) = ∆` F (`) (x).

Proof. The case ` = 1 is straightforward since Z 1 (2.8) f (x + U ) = f (x + u) du = F (x + 1) − F (x) 0

by the Fundamental Theorem of Calculus. The inductive step is     f x + U (`+1) = f x + U (`) + U ∆` F (`) (x + U ) h i = ∆` F (`+1) (x + 1) − F (`+1) (x)

=

=

∆`+1 F (`+1) (x). 

¨ MODIFIED NORLUND POLYNOMIALS

7

The next result is a generalization of (2.3): it shows that the symbols U and B invert each other. The proof uses the evaluation of the definite integral Z ∞ cos zv z −1 z  (2.9) sinh dv = , 2π 2 cosh2 πv 0 which is obtained from entry 3.982.2 in [11]:  −1 Z ∞ πa πa cos ax dx = sinh , (2.10) 2β 2 2β cosh2 βx 0

Re β > 0, a > 0.

A proof of this entry will appear in [6]. Theorem 2.3. For any admissible formal power series, (2.11)

g(x) = f (x + U ) is equivalent to f (x) = g(x + B).

Proof. In view of linearity, it suffices to consider the case f (x) = xn . Start with the generating function Z 1 ∞ X (x + U )n n ez − 1 z(x+U ) z =e = , ez(x+u) du = ezx n! z 0 n=0 and ∞ X (x + B)n n z n! n=0

π 2 Z 1

=

ez(x+B) =

=

π z e 2

 x− 2

  1 z x− 2

Z

Z



  1 z x+iv− 2 sech2 (πv) dv

e −∞ ∞

eizv sech2 (πv) dv

−∞ ∞

= πe

0

cos(zv) dv. cosh2 (πv)

The evaluation (2.10) gives (2.12)

∞ X (x + B)n n z z = ezx z . n! e −1 n=0

Now assume first that g(x) = f (x + U ), i.e., g(x) = (x + U )n . Then ∞ X g(x + B)z n n! n=0

= = =

∞ X (x + B + U )n n z n! n=0

ez − 1 z z ez − 1 zx e z = ezx . e −1 z ez(x+B)

From here it follows that (x + B + U )n = xn . The other direction is established in a similar form.  Note 2.1. A direct extension gives the equivalence of the statements (2.13)

g(x) = f (x + U (`) ) and f (x) = g(x + B (`) ),

which can be proved by induction.

for all ` ∈ N,

8

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

¨ rlund polynomials 3. The generating function of the modified No This section uses the results of the previous section to prove an expression for (`)∗ the horizontal generating function of the modified N¨orlund polynomials Bn as a formal power series. Here ` is a fixed positive integer. This generating function is defined by (3.1)

FB ∗ (z; `) =

∞ X

Bn(`)∗ z n .

n=1

Lemma 3.1. Let ψ(x) be the digamma function and H` the `-th harmonic number. Then for ` ≥ 1 and −1 ≤ p ≤ ` − 1,    x+p ` (3.2) ∆ ψ(x) = H` + ψ(x + p + 1). ` Proof. The result is established first for p = 0. Define    x ψ(x) (3.3) h` (x) = ∆` ` and observe that h`+1 (x) − h` (x)

     x x ψ(x) − ∆` ψ(x) `+1 `       x x = ∆` ∆ ψ(x) − ∆` ψ(x) `+1 `        x+1 x x = ∆` ψ(x + 1) − ψ(x) − ψ(x) . `+1 `+1 ` =

∆`+1



The identity       x+1 x x = + `+1 `+1 `

(3.4) gives h`+1 (x) − h` (x)

    x x (ψ(x + 1) − ψ(x)) + (ψ(x + 1) − ψ(x)) `+1 `      x x 1 + = ∆` x `+1 `   (x − 1) · · · (x − `) (x − 1) · · · (x − ` + 1) = ∆` + (` + 1)! `! =

∆`



The second fraction is a polynomial in x of degree ` − 1. Therefore ∆` annihilates it. The first fraction is a polynomial of degree ` and only its leading term survives the application of ∆` . This leads to the difference equation (3.5)

h`+1 (x) − h` (x) = ∆`

x` 1 = , (` + 1)! `+1

since ∆` x` = `!. The latter follows directly from Lemma 2.2: indeed, choosing f (x) = 1 produces F (`) (x) = x` /`! and therefore (3.6)

∆`

x` = f (x + U (`−1) ) = 1, `!

¨ MODIFIED NORLUND POLYNOMIALS

9

which gives the result. Now write (3.5) as h`+1 (x) − ψ(` + 2) = h` (x) − ψ(` + 1),

(3.7) so that

h` (x) = h1 (x) + ψ(` + 1) − ψ(2).

(3.8) Now (3.9)

h1 (x) = ∆

   x ψ(x) = 1 + ψ(x + 1) 1

gives the stated result for p = 0. Now assume p 6= 0 and that 1 ≤ p ≤ ` − 1. Observe that       x+p x+p 1 1 ∆` (ψ(x + p) − ψ(x)) = ∆` + ··· + ` ` x+p−1 x " `−1  # 1 1 1 ` Y ∆ (x + p − u) × + ··· + = `! x+p−1 x u=0 The bounds 1 ≤ p ≤ ` − 1 show that the last expression is actually  a polynomial of degree ` − 1. One can also easily check that when p = −1, x+p (ψ(x + p) − ψ(x)) ` is a polynomial of degree ` − 1. This implies that for −1 ≤ p ≤ ` − 1, p 6= 0,    x+p (3.10) ∆` (ψ(x + p) − ψ(x)) = 0. ` It follows that ∆

`



  x+p ψ(x) `

  x+p = ∆ ψ(x + p) ` = h` (x + p) `



= H` + ψ(x + p + 1), as can be seen from (3.8) and (3.9). This completes the argument.



The proof of Theorem 1.1 is given next. Proof. Using the symbolic operator B, the left-hand side of Theorem 1.1 can be written as log(x + B (`) ). Let f (x) denote the right-hand side of Theorem 1.1, i.e.,      x−1 ` d`−1 (3.11) ψ x− . f (x) = −H`−1 + `−1 dx `−1 2 Using (2.13), it suffices to prove   f x + U (`−1) = log (x + B) . However from (2.3), (3.12)

log (x + B) = ψ (x) .

So we only need to show that   f x + U (`−1) = ψ(x). Now Lemma 2.2 gives (3.13)

f (x + U (`−1) ) = ∆`−1 F (`−1) (x),

10

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

and writing f (x) as (3.14)

f (x) =

d`−1 dx`−1



     x−1 ` x`−1 ψ x− − H`−1 `−1 2 (` − 1)!

produces (3.15)

F

(`−1)

 (x) =

    x`−1 x−1 ` − H`−1 . ψ x− 2 (` − 1)! `−1

Then (3.16)

`−1



F

(`−1)

(x) = −H`−1 + ∆

`−1



    x−1 ` ψ x− `−1 2

and (3.13) gives     x−1 ` . ψ x− 2 `−1   Now Lemma 3.1, with ` replaced by ` − 1, x replaced by x − 2` and p = b 2` c − 1, yields (3.17)

f (x + U (`−1) ) = −H`−1 + ∆`−1



f (x + U (`−1) ) = ψ(x).

(3.18) This completes the proof.



The proof of Theorem 1.2, which expresses the generating function for the modified N¨ orlund polynomials, is now given. Proof. The proof of the identity (3.19)

FB ∗ (z) =

∞ X

Bn∗ z n = −eval

1 2

log (1 − z)2 − zB



n=1

given in [7, Equation (3.4)] can be adapted to derive, in a similar manner, the relation  ∞   X 1 (`)∗ n 2 (`) (3.20) FB ∗ (z; `) = Bn z = −eval log (1 − z) − zB . 2 n=1 This is described next. Basic facts of umbral calculus, namely −B(`) = B(`) + ` and x + B(`) = B(`) (x), give    ∞ X 1 1 1 (3.21) Bn(`)∗ z n = − log z − eval log z + − 2 − B(`) 2 2 z n=1    1 1 1 (`) = − log z − eval log z + − 2 + B + ` 2 2 z    1 1 1 (`) = − log z − eval log B z+ +`−2 . 2 2 z The final step uses Theorem 1.1. The proof of Theorem 1.3 is presented next.



¨ MODIFIED NORLUND POLYNOMIALS

11

Proof. Start with eval{log B(`) (x)}

eval{log (x + B1 + · · · + B` )}   = E log x − 2` + i(LB1 + · · · + LB` ) .

=

Introduce the notation L = LB1 + · · · + LB` and since the density ρ` is an even function, L and −L have the same distribution. Therefore, with b = (x − `/2)−2 , " !#  2 ` 1 2 (`) E log x− +L eval{log B (x)} = 2 2  ` 1  = log x − + E log(1 + bL2 ) 2 2 Z 1 ∞ ` log(1 + bu2 )ρ` (u) du = log x − + 2 2 −∞ Z ∞ ` = log x − + (3.22) log(1 + bu2 )ρ` (u) du, 2 0 since ρ` is an even function of u. The result now follows from Theorem 1.1.



4. A family of densities and a differential-difference equation This section discusses the densities ρn (x) defined by the recurrence Z ∞ (4.1) ρn (x) = ρn−1 (y)ρ1 (x − y)dy −∞

with initial condition (4.2)

ρ1 (x) = ρ(x) =

π sech2 (πx). 2

These densities provide the evaluation    Z ` X (4.3) E g x − ` + i Bj   = 2

j=1



−∞

g(x −

1 2

+ iv)ρ` (v)dv.

In particular, the generating function of the N¨orlund polynomials is linked to these densities via Theorem 1.4. Some properties of these densities are described next. Lemma 4.1. The Fourier transform of ρ1 (x) is given by πξ . (4.4) ρb1 (ξ) = sinh πξ Proof. The Fourier transform is given by Z ∞ π ρb1 (ξ) = sech2 (πx)e−2πixξ dx −∞ 2 Z ∞ cos(2πxξ) = π dx, cosh2 (πx) 0 and the result follows by using (2.9). Corollary 4.1. The Fourier transform of ρ` (x) is given by  ` πξ (4.5) ρb` (ξ) = . sinh πξ



12

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

Proof. This follows directly from the fact that Fourier transform converts convolutions into products.  The Fourier inversion formula now gives a representation for the density ρ` (x) as (4.6)

1 ρ` (x) = π

Z





−∞

y sinh y

`

e2ixy dy.

Note 4.2. J. Pitman and M. Yor [13, p. 299] studied the function ` Z ∞ y 1 eixy dy (4.7) φ` (x) = 2π −∞ sinh y as part of their study on infinitely divisible distributions generated by L´evy processes associated with hyperbolic functions. The expression (4.6) shows that (4.8)

ρ` (x) = 2φ` (2x).

These authors show that φt satisfies the differential-difference equation (4.9)

`(` + 1)φ`+2 (x) = (x2 + `2 )φ00` (x) + 2(` + 2)xφ0` (x) + (` + 1)(` + 2)φ` (x).

Note 4.3. The authors of [13] also consider the transform ` Z ∞ 1 1 eixy dy (4.10) ψ` (x) = 2π −∞ cosh y and prove the explicit formulae (4.11)

ψ` (x) =

  2 ` + ix 2`−2 Γ . πΓ(`) 2

Then, they state ‘we do not know of any explicit formula for φ` like (4.11) valid for general ` > 0’. Note 4.4. The density functions ρ` (x) have also appeared in Airault [1, p. 2109, (1.52), (1.53)]. This author proves that   π 1−2` d2` Q2`−1 (πx) ρ2` (x) = (4.12) 2(2` − 1)! dx2` tanh(πx) ρ2`+1 (x)

=

π −2` d2`+1 [Q2` (πx) tanh(πx)] 2(2`)! dx2`+1

where (4.13)

Q2` (x) =



Y 1≤j≤2`−1

x2 +

π2 j 2 4



j odd

and (4.14)

Q2`+1 (x) = x

Y

(x2 + j 2 π 2 ).

1≤j≤`

The differential-difference equation (4.9) produces (4.15) `(` + 1)ρ`+2 (x) =

(4x2 + `2 ) 00 ρ` (x) + 2x(` + 2)ρ0` (x) + (` + 1)(` + 2)ρ` (x), 4

¨ MODIFIED NORLUND POLYNOMIALS

13

so that ρ` (x) can be obtained from (4.15) and the initial conditions ρ1 (x) in (4.2) and ρ2 (x). Even though the expression for ρ2 (x) is well-known [13, p. 312, Table 6], it is derived here for the sake of completeness. Lemma 4.2. The density function ρ2 is given by π (πx coth(πx) − 1) . (4.16) ρ2 (x) = sinh2 (πx) Proof. The relation (1.27) gives Z ∞ ρ1 (u)ρ1 (x − u) du ρ2 (x) = −∞

= =

Z π2 ∞ du 4 −∞ cosh2 (πu) cosh2 (π(x − u)) Z dt π ∞ . 4 −∞ cosh2 t cosh2 (πx − t)

The change of variable w = e2t gives Z ∞ (4.17) ρ2 (x) = 2π 0

w dw , (w + 1)2 (α + βw)2

with α = eπx and β = e−πx . The final integral is evaluated by partial fractions to produce the stated result.  The higher densities ρ` (x), ` > 2, can now be computed via (4.15) and the expressions in (4.2) and (4.16). The next step is to show that the integral appearing in Theorem 1.3 satisfies a differential-difference equation. Theorem 4.3. The integral Z z` (b) :=



log(1 + bu2 ) ρ` (u) du

0

satisfies the differential-difference equation   ` `(` + 1)y`+2 (x + 1) = x(x − + 2(` + 1) x − y`0 (x) 2 `2 + `(` + 1)y` (x) + 2 4 x − 2` `)y`00 (x)

(4.18)

for b = (x − `/2)−2 . Proof. Let b > 0. Start with (4.15), i.e.,   `2 `(` + 1)ρ`+2 (u) = u2 + ρ00` (u) + 2u(` + 2)ρ0` (u) + (` + 1)(` + 2)ρ` (u). 4 Multiply both sides by log(1 + bu2 ) and integrate both sides from 0 to ∞ to obtain  Z ∞ `2 2 `(` + 1)z`+2 (b) = u + log(1 + bu2 ) ρ00` (u) du 4 0 Z ∞ (4.19) + 2(` + 2) u log(1 + bu2 ) ρ0` (u) du + (` + 1)(` + 2)z` (b). 0

14

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

Let ∞

Z

u log(1 + bu2 ) ρ0` (u) du,  Z ∞ `2 2 u + I2 (b, `) := log(1 + bu2 ) ρ00` (u) du. 4 0

I1 (b, `) :=

0

(4.20)

Consider I1 (b, `) first. Integration by parts yields (4.21)  ∞ I1 (b, `) = u log(1 + bu2 )ρ` (u) 0 −

Z 0





 2bu2 2 + log(1 + bu ) ρ` (u) du. 1 + bu2

Note that ρ` (t) → 0 as t → ∞. This is easily seen for ρ1 since (4.22)

ρ1 (t) =

π 2πe−2πt sech2 (πt) = → 0 as t → ∞. 2 (1 + e−2πt )2

For ` ≥ 2, use the definition of ρ` (t) in (1.27), and the above asymptotic for ρ1 , along with Lebesgue’s dominated convergence theorem to deduce that ρ` (t) → 0 as t → ∞. As t → 0, it is easy to see that the densities ρ` (t) are finite. This implies that the boundary terms in (4.21) vanish so that Z ∞ d I1 (b, `) = −z` (b) − 2b ρ` (u) log(1 + bu2 ) du db 0 d (4.23) = −z` (b) − 2b z` (b), db where differentiation (with respect to b) under the integral sign was employed in the last step. Now consider I2 (b, `), use integration by parts twice, and note that the boundary terms again vanish, thereby giving  Z ∞ 2 b(` + (20 − b`2 )u2 + 12bu4 ) 2 I2 (b, `) = + 2 log(1 + bu ) ρ` (u) du 2(1 + bu2 )2 0 Z ∞ 2 b (` + (20 − b`2 )u2 + 12bu4 ) = 2z` (b) + (4.24) ρ` (u) du. 2 0 (1 + bu2 )2 Next, use the following representation (4.25)

(`2 + (20 − b`2 )u2 + 12bu4 ) `2 (8 − b`2 )u2 12u2 = + + (1 + bu2 )2 (1 + bu2 )2 (1 + bu2 )2 1 + bu2

to rewrite the above expression for I2 (b, `) in the form  Z Z ∞ 2 b 2 ∞ ρ` (u) u ρ` (u) 2 I2 (b, `) = 2z` (b) + ` du + (8 − b` ) du 2 )2 2 (1 + bu (1 + bu2 )2 0 0  Z ∞ 2 u ρ` (u) (4.26) + 12 du . 1 + bu2 0 As shown before, Z (4.27) 0

Since



u2 ρ` (u) d du = z` (b). 1 + bu2 db

ρ` (u) u2 ρ` (u) = ρ (u) − b , ` 1 + bu2 1 + bu2

¨ MODIFIED NORLUND POLYNOMIALS

and ρ` , being a probability density, satisfies Z (4.28) 0



ρ` (u) 1 du = − b 1 + bu2 2

Z 0



R∞ −∞

15

ρ` (u) = 1, it is seen that

u2 ρ` (u) 1 d du = − b z` (b). 1 + bu2 2 db

Differentiation (with respect to b) under the integral sign then gives Z ∞ 2 d2 d u ρ` (u) du = b 2 z` (b) + z` (b). (4.29) 2 2 (1 + bu ) db db 0 Similarly it can be shown that Z ∞ ρ` (u) 1 d d2 (4.30) du = − 2b z` (b) − b2 2 z` (b). 2 2 (1 + bu ) 2 db db 0 Now substitute (4.27), (4.29) and (4.30) in (4.26) and simplify to obtain   2 3b`2 d b`2 2 2 d (4.31) I2 (b, `) = b (4 − b` ) 2 z` (b) + b 10 − z` (b) + 2z` (b) + . db 2 db 4 Then substitute (4.23) and (4.31) in (4.19) to deduce that   d2 3b`2 d `(` + 2)z`+2 (b) = b2 (4 − b`2 ) 2 z` (b) + 2b 1 − 2` − z` (b) db 4 db b`2 (4.32) + `(` + 1)z` (b) + . 4 Now let b = (x − `/2)−2 as in Theorem 1.3, so that defining y` (x) := z` (b), and replacing ` by ` + 2, gives z`+2 ((x − 1 − `/2) (4.33)

−2

) = y`+2 (x), and hence

z`+2 (b) = y`+2 (x + 1).

A direct computation now gives  3 d 1 ` z` (b) = − x− y`0 (x), db 2 2  6  5 ` 3 ` d2 1 00 (4.34) x − y (x) + x − y`0 (x), z (b) = ` ` db2 4 2 4 2 where the prime denotes differentiation with respect to x. Finally, substitute (4.33) and (4.34) in (4.32) to arrive at (4.18).  Remark: The case ` = 1 of Theorem 1.3 was derived in [7, Equation (2.28)] and an elementary proof of the case ` = 2 is given in the next section. The differentialdifference equation (4.18) then produces the values of Z ∞ log(1 + bu2 ) ρ` (u) du 0

for any ` > 2.

16

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

¨ rlund 5. The special case ` = 2 of the generating function of the No polynomials In this section, we present a different proof of Theorem 1.2 for ` = 2 which was, in fact, the genesis of this project. It involves brute force verification of Theorem 1.3 when ` = 2. It is then used along with the result in (3.22), namely, Z ∞ (5.1) log(1 + bu2 )ρ2 (u) du eval{log B(2) (x)} = log |x − 1| + 0 −2

with b = (x − 1) , and the special case of (3.21), namely,    ∞ X 1 1 1 (2) (2)∗ n (5.2) z+ . Bn z = − log z − eval log B 2 2 z n=1 The point to illustrate here is that these calculations soon become out of reach for large values of `. In fact, the case ` = 3 itself required six different integrals to be evaluated in order to arrive at Theorem 1.3 through the direct computation of the integral. At the end of the previous section, another way of calculating these integrals for all ` through a differential-difference equation was given. However, this being a recursive way, not only does it not give an explicit formula but also for higher values of `, evaluating the integrals this way is a cumbersome process. These shortcomings are what led us to seek a new representation for eval{log B(`) (x)}, namely Theorem 1.1, which gives an explicit formula for these integrals, avoiding messy calculations at the same time. Proposition 5.1. Let a 6= 0 and Z ∞ (x coth x − 1) log(1 + a2 x2 ) dx. (5.3) I(a) = sinh2 x 0 Then I(a) = − log c − 1 + ψ(c) + c ψ 0 (c),

(5.4)

1 . πa Proof. To evaluate this integral, observe first that   d x 2(x coth x − 1) (5.5) coth x − = 2 dx sinh x sinh2 x and write   Z 1 ∞ d x (5.6) I(a) = log(1 + a2 x2 ) coth x − dx. 2 0 dx sinh2 x In order to integrate by parts and guarantee the convergence of the boundary terms, write the integral as   Z 1 ∞ x 2 2 d (5.7) I(a) = log(1 + a x ) coth x − 1 − dx. 2 0 dx sinh2 x Integrate by parts and verify that the boundary terms vanish to produce with c =

I(a) = a2 (I1 (a) + I2 (a))

(5.8) with Z (5.9)

I1 (a) = 0



x(1 − coth x) dx and I2 (a) = 1 + a 2 x2

Z 0



x2 dx . (1 + a2 x2 ) sinh2 x

¨ MODIFIED NORLUND POLYNOMIALS

17

The evaluation of I1 (a) is described first. Write it as Z ∞ x dx e−x I1 (a) = − sinh x 1 + a2 x2 Z0 ∞ x dx = −2 2 x2 )(e2x − 1) (1 + a 0    1 1 πa = ψ + + log(πa) a2 πa 2 using Entry 3.415.1 of [11]:      Z ∞ x dx 1 βµ π βµ = log − −ψ , 2 + β 2 )(eµx − 1) (x 2 2π βµ 2π 0

Re β > 0, Re µ > 0,

d where ψ(z) = dz log Γ(z) is the digamma function. A direct proof of this entry and some generalizations appear in [4]. To evaluate I2 (a) write it as Z ∞ x2 e2x dx (5.10) I2 (a) = 4 (1 + a2 x2 )(e2x − 1)2 0   Z ∞ x2 d 1 = −2 dx. 1 + a2 x2 dx e2x − 1 0

Integration by parts and a simple scaling produces Z ∞ 4 x dx (5.11) I2 (a) = 4 2 a π 0 (x2 + c2 )2 (e2πx − 1) with c = 1/(πa). Entry 3.415.2 in [11], established in [4], states that Z ∞ 1 x dx 1 1 0 (5.12) =− 3 − 2 + ψ (β), 2 + β 2 )2 (e2πx − 1) (x 8β 4β 4β 0 which gives (5.13)

π 1 1 I2 (a) = − − 2 + 3 ψ 0 2a a πa



1 πa

 .

Replacing the values of I1 (a) and I2 (a) in (5.8) gives the result.



We now obtain Theorem 1.2 for ` = 2 using the above proposition. To that end, let x = πu and a2 = b/π 2 in (5.3) and use Lemma 4.16 to find that     Z ∞ 1 1 0 1 1 2 ρ2 (u) log(1 + bu ) du = ψ √ +√ ψ √ + log b − 1. 2 b b b 0 The above equation, along with (5.1) and the fact that b = (x − 1)−2 , yields n o eval log B(2) (x) = ψ (|x − 1|) + |x − 1| ψ 0 (|x − 1|) − 1. Hence for x ≥ 1, we have n o (5.14) eval log B(2) (x) = ψ (x − 1) + (x − 1)ψ 0 (x − 1) − 1. Substitute this in (5.2) to obtain (5.15)         ∞ X 1 1 1 1 1 0 (2) ∗ n ψ z+ −1 + z+ −1 ψ z+ −1 −1 . Bn z = − log z − 2 2 z z z n=1

18

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

This completes the proof. 6. Integrals involving Chebyshev polynomials This section presents the evaluation of some integrals involving the Chebyshev polynomials obtained as byproducts of the former results. The proof uses the Binet formulas (1.13) and (1.14) for these polynomials. The discussion begins with some preliminary results. Lemma 6.1. Let b > 0. Then   1 d2` 2(−1)`−1 b` (2` − 1)! 2 √ log(1 + bu T (6.1) ) = 2` du2` (1 + bu2 )` 1 + bu2 and d2`+1 2(−1)` b`+1 (2`)!u 2 ) = log(1 + bu U2` du2`+1 (1 + bu2 )`+1

(6.2)

 √

1 1 + bu2

 .

Proof. The proof is given for the second formula. The first one can be established by the same procedure. Successive differentiation gives √ d2`+1 (−1)` ib`+1/2 (2`)! √ log(1 ± i (6.3) bu) = ± . du2`+1 (1 ± i bu)2`+1 Hence   1 d2`+1 1 2 ` `+1/2 √ √ log(1 + bu ) = (−1) ib (2`)! − du2`+1 (1 + i bu)2`+1 (1 − i bu)2`+1   ` `+1 2(−1) b (2`)!u 1 = U2` √ 2 `+1 (1 + bu ) 1 + bu2 using (1.14).  The representation for the densities ρ` (u) given by Airault are now used to produce some spectacular integrals involving the Chebyshev polynomials. Theorem 6.2. Let T` (x) be the Chebyshev polynomial of the first kind. Define (6.4)

P1 (u, `) =

`−1 Y

(u2 + j 2 ) and P2 (u, `) =

j=1

`  Y

u2 + j −

 1 2 2



j=1

Then, for x > `, !  Z ∞ x − ` du uP1 (u, `) − u2`−1 T2` p = 2 + (x − `)2 )` 2 2 tanh(πu) (u u + (x − `) 0     d2`−1 x−1 ` (−1) log(x − `) + H2`−1 − 2`−1 ψ(x − `) , dx 2` − 1 and for x > ` + 21 , Z 0





 tanh(πu)P2 (u, `) − u2` U2`  q (−1)`



x−`−



1 2 1 2 2)



u du = (u2 + (x − ` − 21 )2 )`+1

u2 + (x − ` −    d2` x−1 1 1 log(x − ` − 2 ) + H2` − 2` ψ(x − ` − 2 ) . dx 2`

¨ MODIFIED NORLUND POLYNOMIALS

19

Proof. The details are given for the second formula. The expression for the density functions in given by Airault in (4.12) are written as  2`+1 d (6.5) ρ2`+1 (u) = C` [P2 (u, `) tanh(πu)] du with C` = (2(2`)!)−1 . Therefore Z ∞ Z 2 ρ2`+1 (u) log(1+bu ) du = C` 0

2`+1 d log(1+bu ) [P2 (u, `) tanh(πu)] du du 0 " #  2` Z ∞ d 2 d [P2 (u, `) tanh(πu)] du. = C` log(1 + bu ) du du 0 ∞

2



In order to integrate by parts, the boundary terms at +∞ need to be modified. Observe that  2` j  2`−j 2`    X d 2` d d [P2 (u, `) tanh(πu)] = [tanh(πu)] [P2 (u, `)] j du du du j=0 =

(2`)! tanh(πu) + j  2`−j 2`    X 2` d d [tanh(πu)] [P2 (u, `)] j du du j=1

The terms coming from derivatives of tanh(πu) in the second sum are polynomials in sech2 u, without a constant term. The terms coming from P2 (u, `) are polynomials in u. It follows that the whole second sum vanishes as u → +∞. Then Z ∞ ρ2`+1 (u) log(1 + bu2 ) du 0 "  # Z ∞ 2`   d 2 d 2` = C` log(1 + bu ) P2 (u, `) tanh(πu) − u du. du du 0 and now integration by parts gives Z ∞ ρ2`+1 (u) log(1 + bu2 ) du 0

2`+1 d log(1 + bu2 ) du. du 0 Now use Theorem 1.3 to evaluate the integral on the left-hand side and Lemma 6.1 to obtain the result.  Z

= C`



  P2 (u, `) tanh(πu) − u2`



7. Relations to the Hurwitz and Barnes zeta functions This section expresses the densities ρ` (x) in terms of the Hurwitz zeta function. This is the used to produce the closed-form evaluations of some integrals involving the Hurwitz zeta function. Definition 7.1. Let N ∈ N and w, s ∈ C with Re w > 0, Re s > N . The Barnes zeta function is defined by the series ∞ X (7.1) ζN (s, w|a1 , · · · , aN ) = (w + m1 a1 + · · · + mN aN )−s . m1 ,··· ,mN =0

20

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

This function was introduced in [3] and contains, as the special case N = 1 and a1 = 1, the Hurwitz zeta function ∞ X 1 . (7.2) ζ(s, w) = (n + w)s n=0 A class of definite integrals connected to ζ(s, w) was described in [8, 9]. In particular, the classical identity of Lerch [11, entry 9.533.3] √ d (7.3) ζ(z, q) |z=0 = log Γ(q) − log 2π dz gives the classical evaluation Z 1 √ log Γ(z) dz = log 2π (7.4) 0

given by L. Euler, as well as Z 1 √ π2 1 γ2 4  √ 2 + + γ log 2π + (7.5) log2 Γ(z) dz = log 2π 12 48 3 3 0 √ ζ 0 (2) ζ 00 (2) − (γ + 2 log 2π) 2 + . π 2π 2 The corresponding evaluations for the integrals of log` Γ(z), for ` = 3, 4 are more complicated and they involve multiple-zeta values. In particular, the existence of formulas for ` ≥ 5, remains an open problem. See [2] for details. The connection between the Hurwitz zeta function and the densities ρ` (x) is based on an integral representation of the Barnes zeta function given by S. N. M. Ruijsenaars [14, p. 121]. Introducing the notation AM = 21 (a1 +· · ·+aM ), it is shown in [14] that if δ > −AM , the Barnes zeta function has the integral representation Z 21−M ∞ (2y)s−1 e−2δy Q (7.6) ζM (s, AM + δ + iz|a1 , · · · , aM ) = e−2izy dy Γ(s) 0 1≤j≤M sinh(aj y) for Re s > M and Im z < AM + δ. Now choose n ∈ N and consider the special case δ = 0, M = `, s = ` + 1 and aj = 1 for 1 ≤ j ≤ M . This yields the identity  ` Z y 2 ∞ −2izy ` (7.7) ζ` (` + 1, 2 + iz|1, · · · , 1) = e dy. `! 0 sinh y The next result gives a new representation for the density ρ` (x) in terms of the Barnes zeta function. The proof comes directly from (4.6). Proposition 7.2. Let (7.8)

ζ` (m, z) = ζ` (m, z|1, · · · , 1).

Then the density function ρ` (x) is given by  `! (7.9) ρ` (x) = ζ` (` + 1, 2` + ix) + ζ` (` + 1, 2` − ix) . 2π The next representation for the densities ρ` (x) comes from a result of J. Choi [5, Equation (2.5)], which expresses ζ` (s, w) as a finite linear combination of the Hurwitz zeta function, in the form (7.10)

ζ` (s, w) =

`−1 X j=0

p`,j (w)ζ(s − j, w)

¨ MODIFIED NORLUND POLYNOMIALS

21

where (7.11)

p`,j (w) =

`−1   (−1)`+1−j X m s(`, m + 1)wm−j , (` − 1)! m=j j

where s(`, m) is the Stirling number of the first kind. Then (7.9) leads to `−1 `−1   X `(−1)`+1 X m (−1)j s(`, m + 1) j 2π j=0 m=j ( m−j    m−j  ) ` ` ` ` ζ ` + 1 − j, + ix + ζ ` + 1 − j, − ix . × + ix − ix 2 2 2 2

(7.12) ρ` (x) =

It follows that the logarithmic moment can be expressed as   Z ∞ u2 ρ2` (u) log 1 + du = (x − `)2 0 `−1 2`−1 X 2` X (−1)j−1 s(2`, m + 1) π j=0 m=j ∞

Z



× Re

 (` + iu)m−j ζ(2` + 1 − j, ` + iu) log 1 +

0

u2 (x − `)2

 du.

Now replace ` by 2` in (3.22) and Theorem 1.1, equate their right-hand sides, and use the above identity to arrive at first of the following two identities. The second one is similarly proved. Theorem 7.3. Let ζ(s, w) denote the Hurwitz zeta function and s(`, m) the Stirling numbers of the first kind. Define   Z ∞ u2 m−j z` (m, j)(x) = 2 Re (` + iu) ζ(2` + 1 − j, ` + iu) log 1 + du (x − `)2 0 and ∞

Z Z` (m, j)(x) = 2 Re 0

 (`+ 21 +iu)m−j ζ(2`+2−j, `+ 21 +iu) log 1 +

u2 (x − ` − 21 )2



Then, for x > `, 2`−1 X

j−1

(−1)

j=0

2`−1 X m=j

 m s(2`, m + 1)z` (m, j)(x) = j     d2`−1 x−1 π log(x − `) + H2`−1 − 2`−1 ψ(x − `) , − ` dx 2` − 1

and x > ` + 21 , 2` 2`   X X m (−1)j s(2` + 1, m + 1)Z` (m, j)(x) = j j=0 m=j       2π d2` x−1 1 1 − log x − ` − 2 + H2` − 2` ψ x − ` − 2) . 2` + 1 dx 2`

du

22

A. DIXIT, A. KABZA, V. MOLL, AND C. VIGNAT

Inverting these systems of equations to obtain expressions for Yn (m, j) and Zn (m, j) is an open problem. Acknowledgments. The authors wish to thank Larry Glasser for discussions on this project. Partial support for the work of the third author comes from NSFDMS 1112656. The first author is a post-doctoral fellow, funded in part by the same grant. The work of the C. Vignat was partially supported by the iCODE Institute, Research Project of the Idex Paris-Saclay. References [1] H. Airault. Hyperbolic measures, moments and coefficients. Algebra on hyperbolic functions. J. Funct. Anal., 255:2099–2145, 2008. [2] D. H. Bailey, D. Borwein, and J. M. Borwein. Eulerian Log-Gamma integrals and TornheimWitten zeta functions. The Ramanujan Journal, to appear, 2015. [3] E. W. Barnes. On the theory of the multiple gamma function. Trans. Camb. Philos. Soc., 19:374–425, 1904. [4] G. Boros, O. Espinosa, and V. Moll. On some families of integrals solvable in terms of polygamma and negapolygamma functions. Integrals Transforms and Special Functions, 14:187–203, 2003. [5] J. Choi. Explicit formulas for the Bernoulli polynomial of order n. Indian J. Pure Appl. Math., 27:667–674, 1996. [6] A. Dixit, A. Kabza, V. Moll, and C. Vignat. The integrals in Gradshteyn and Ryzhik. Part 30: More hyperbolic entries. In preparation, 2015. [7] A. Dixit, V. Moll, and C. Vignat. The Zagier modification of Bernoulli numbers and a polynomial extension. Part I. The Ramanujan Journal, 33:379–422, 2014. [8] O. Espinosa and V. Moll. On some definite integrals involving the Hurwitz zeta function. Part 1. The Ramanujan Journal, 6:159–188, 2002. [9] O. Espinosa and V. Moll. On some definite integrals involving the Hurwitz zeta function. Part 2. The Ramanujan Journal, 6:449–468, 2002. [10] I. Gessel. Applications of the classical umbral calculus. Algebra Universalis, 49:397–434, 2003. [11] I. S. Gradshteyn and I. M. Ryzhik. Table of Integrals, Series, and Products. Edited by D. Zwillinger and V. Moll. Academic Press, New York, 8th edition, 2015. [12] N. E. N¨ orlund. Vorlesungen u ¨ber Differenzen-Rechnung. Berlin, 1924. [13] J. Pitman and M. Yor. Infinitely divisible laws associated with hyperbolic functions. Canad. J. Math., 55:292–330, 2003. [14] S. N. M. Ruijsenaars. On Barnes’ multiple zeta and gamma function. Adv. Math., 156:107– 132, 2000. [15] J. Spanier and K. Oldham. An atlas of functions. Hemisphere Publishing Co., 1st edition, 1987. [16] D. Zagier. A modified Bernoulli number. Nieuw Archief voor Wiskunde, 16:63–72, 1998. Department of Mathematics, Tulane University, New Orleans, LA 70118 E-mail address: [email protected] Department of Mathematics, Tulane University, New Orleans, LA 70118 E-mail address: [email protected] Department of Mathematics, Tulane University, New Orleans, LA 70118 E-mail address: [email protected] Department of Mathematics, Tulane University, New Orleans, LA 70118 and, Dept. of Physics, Universite Orsay Paris Sud, L. S. S./Supelec, France E-mail address: [email protected]

z

Nov 4, 2014 - Here α ∈ C. The coefficients B. (α) n are called ..... It is clear that if f is a polynomial of degree l, then ∆f(x) is also a polynomial and its degree is l ...

369KB Sizes 3 Downloads 186 Views

Recommend Documents

xgBDJBIy11111lz[ Z|xgBDJBIy22222kzU Z ... - John Andersen
May 16, 2014 - Hurley is leaving behind a career span- ning thousands of students, dozens of col- leagues and countless memories. “I'm going to miss it a lot,” ...

( )ffi?Z
ilcsre:- The license in iustaut case is granted to Countrywide Promoters. Pvt. Ltd' but, application for approval of senrice plan estimates for area of 26.6I'9 acres ...

03 01 01) 01)z 02). 02)z 01 01)z
polymerization reactor using the CMAC neural network for knowledge storage,” Proc. Inst. Elect. ... work was supported by the National Natural Science Foundation of China under. Grants 60304017, 20336040, and ... impossible to propose a universal s

Z tablosu.pdf
Loading… Whoops! There was a problem loading more pages. Whoops! There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Z tablosu.pdf. Z tablosu.pdf. Open. Extra

Z
~S S S. ,~. "" " ~o. oo :E. JO. "" " "0. " '" .c. ," ." oo oo oo oo .". .. oo:I: " " " " ,s '0 "0-. " " " ".a " d. "" ." .c .c .t:>. ~". c>' > >. S oo.

Z l 'P
Aug 4, 2010 - CIRCUIT. T 2 N. m s mT. C b Tm. R S A /> a Jim W. I"WI 1| vm ,we. W 02. W. FIG. .... current-limit signal VM and a blanking adjustment signal VB.

z- transform.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. z- transform.pdf.Missing:

Standard Normal (Z) Table Area between 0 and z
Source: http://www.statsoft.com/textbook/stathome.html?sttable.html&1 ... As shown in the illustration below, the values inside this table are critical values of the ...

Select Z Bibliography - CiteSeerX
abstract machines; Formal definition of abstract machines; Theory of abstract machines;. Constructing large ... Métayer, editors,Prospects for Functional Programming in Software Engineering, volume 1 of Research ...... Copies available from: Researc

PAK-Z+ - Research
Aug 15, 2005 - Craig Gentry, Philip MacKenzie, Zulfikar Ramzan. DoCoMo USA Labs. {cgentry ...... [14] T. Dierks and C. Allen. The TLS protocol, version 1.0, ...

Z. ANSWERS.pdf
Maximum height is 122.5 m and total time is 5 s + 5 s = 10 s. 14. 19.6 m/s. 15. Maximum height = 80 m, Net displacement = 0, Total distance covered = 160 m.

Lodrick, Z.
BA Hons (1st). Dip (psych). Dip (couns). UKCP .... Achieving Best Evidence (ABE) (Office for Criminal Justice Reform, 2007). Summary. In this article I have ...

Z l 'P
Aug 4, 2010 - current-limit signal VM and a blanking adjustment signal VB in response to the ..... rent signal during a ?rst period When the poWer transistor is.

l=h; dk;Z
fuEufyf[kr dh O;k[;k dhft,%. ¼2x6=12½. ¼d½ fuoy oLrq&fofue; O;kikj fLFkfr. ¼[k½ voewY;u. Hkkx&III x½ y?kq mÙkj iz'u ¼izR;sd iz'u dk mÙkj yxHkx 100 'kCnksa ...

List_Ministra_Edukacji_Narodowej_do_Rodzicow Z 13.01.2017.pdf ...
Jan 13, 2017 - Minister Edukacji Narodowej. Warszawa, 13 stycznia 2017 r. Page 1 of 1. List_Ministra_Edukacji_Narodowej_do_Rodzicow Z 13.01.2017.pdf.

∫ ∫ ' z ∫
3.a) If w = f(z) is an analytic function, then prove that the family of curves defined by · u(x,y) = constant cuts orthogonally the family of curves v(x,y) = constant.

z-transformation
Partial fraction method and. (iii). Inversion integral method or Residues method. Inversion method or Residues Method: The inverse Z-Transform of U(z) is given ...

Z Reference Card - Mike Spivey
Free type definition. Ans ::= ok ¡. £ ¢ ... Domain. ranR. \ran R. Range id X. \id X. Identity relation. Q ¥ R. Q \comp R. Composition ... Domain anti-restriction. R § S.

0 CO z
1•. 0. 0< uo rf. > L)J1. < z. 0. N. -d. -J. U. > z. 0 z. LLJ. 0. U. 0•. U-. 0 z w. N. N. I-. 0 ...... TX). It ((a .0. (tO .0. C. X). CD. ((a. 'r. = ci)LUWWWLIJWLU It-JWWWW cij ((a.

Z-1.pdf
modificações dos hábitos e padrões alimentares, comprometem a formação dentária natural desta. espécie e levam a uma série de afecções odontológicas. Os ...

Lodrick, Z. (2007)
to recover, and to sustain themselves in undertaking trauma work. ..... Erskine, 2004; O'Brien & Houston, 2000) and for traumatized individuals their day ... data about previous traumas) it will be hyper-sensitive to any trigger related to previous.

Z Reference Card - Mike Spivey's
Domain. ranR. \ran R. Range id X. \id X. Identity relation. Q £ R. Q \comp R. Composition. Q ◦ R. Q \circ R. Backwards comp. S ¨ R. S \dres R. Domain restriction.