Multiple zeta values for classical special functions Tanay Wakhare, - - PowerPoint PPT Presentation

multiple zeta values for classical special functions
SMART_READER_LITE
LIVE PREVIEW

Multiple zeta values for classical special functions Tanay Wakhare, - - PowerPoint PPT Presentation

Multiple zeta values for classical special functions Tanay Wakhare, Christophe Vignat May 23, 2018 Tanay Wakhare MZV Given some function G ( z ) , we denote by { a n } the set of its zeros (assumed to be non-zero complex numbers). Then define a


slide-1
SLIDE 1

Multiple zeta values for classical special functions

Tanay Wakhare, Christophe Vignat May 23, 2018

slide-2
SLIDE 2

Tanay Wakhare

slide-3
SLIDE 3

MZV

Given some function G(z), we denote by {an} the set of its zeros (assumed to be non-zero complex numbers). Then define a zeta function associated with G as ζG(s) =

  • n=1

1 as

n

.

slide-4
SLIDE 4

MZV

Given some function G(z), we denote by {an} the set of its zeros (assumed to be non-zero complex numbers). Then define a zeta function associated with G as ζG(s) =

  • n=1

1 as

n

. We also construct a multiple zeta function as ζG(s1, . . . , sr) =

  • n1>n2>···>nr≥1

1 as1

n1 · · · asr nr

and a multiple zeta-starred function as ζ∗

G(s1, . . . , sr) =

  • n1≥n2≥···≥nr≥1

1 as1

n1 · · · asr nr

.

slide-5
SLIDE 5

MZV

Denote ζG ({s} n) = ζG ({s, s, . . .}) ζ∗

G ({s}}n) = ζ∗ G ({s, s, . . .})

slide-6
SLIDE 6

MZV and ground states

Given a quantum system with eigenvalues {E1, E2, . . .}, arranged in decreasing order of magnitude, the quantum zeta function Z(s) is defined as the series Z(s) =

  • n=1

1 E s

n

, and the ground state energy E1 can be approximated as E1 ∼ Z (s)

1 s

slide-7
SLIDE 7

MZV and ground states

Given a quantum system with eigenvalues {E1, E2, . . .}, arranged in decreasing order of magnitude, the quantum zeta function Z(s) is defined as the series Z(s) =

  • n=1

1 E s

n

, and the ground state energy E1 can be approximated as E1 ∼ Z (s)

1 s

In the case of a quantum multiple zeta function Z (s1, s2, . . . , sr) , an equivalent is Z ({s} r)

1 s ∼

1 E1E2 · · · Er

slide-8
SLIDE 8
  • utline

We address two questions in this talk:

◮ what does the knowledge of the Weierstrass product

factorization of the function G tell us about the MZV built

  • n its zeros ?
slide-9
SLIDE 9
  • utline

We address two questions in this talk:

◮ what does the knowledge of the Weierstrass product

factorization of the function G tell us about the MZV built

  • n its zeros ?

◮ what are the benefits of introducing generalized Bernoulli

numbers in the computation of the MZV’s ?

slide-10
SLIDE 10

Definitions and Methodology

Symmetric functions

  • the elementary symmetric functions er =

i1<i2<...<ir xi1xi2 · · · xir ,

  • the complete symmetric functions hr =

i1≤i2≤...≤ir xi1xi2 · · · xir

  • the power sums pr =

i xr i .

slide-11
SLIDE 11

Definitions and Methodology

Symmetric functions

  • the elementary symmetric functions er =

i1<i2<...<ir xi1xi2 · · · xir ,

  • the complete symmetric functions hr =

i1≤i2≤...≤ir xi1xi2 · · · xir

  • the power sums pr =

i xr i .

The symmetric functions have generating functions E(t) =

  • k=0

ektk =

  • i=1

(1 + txi) , H(t) =

  • k=0

hktk =

  • i=1

(1 − txi)−1 = E(−t)−1, P(t) =

  • k=1

pktk−1 =

  • i=1

xi 1 − txi = H′(t) H(t) = E ′(−t) E(−t) .

slide-12
SLIDE 12

Definitions and Methodology

Lemma

When xi = 1

as

i ,

pk = ζG (ks) =

  • n=1

1 aks

n

ek = ζG

  • {s} k

=

  • n1>n2>···>nr≥1

1 as

n1as n2 . . . as nk

and hk = ζ∗

G

  • {s} k

=

  • n1≥n2≥···≥nr≥1

1 as

n1as n2 . . . as nk

slide-13
SLIDE 13

Definitions and Methodology

As a consequence define the averaged zeta S(mn, k) =

  • |a|=n

ζG(ma1, . . . , mak), S∗

G(mn, k) =

  • |a|=n

ζ∗

G(ma1, . . . , mak)

slide-14
SLIDE 14

Definitions and Methodology

As a consequence define the averaged zeta S(mn, k) =

  • |a|=n

ζG(ma1, . . . , mak), S∗

G(mn, k) =

  • |a|=n

ζ∗

G(ma1, . . . , mak)

The following generating products hold:

  • k=1
  • 1 + (y−1)t

as

k

  • 1 − t

as

k

  • =

  • n=0

n

  • k=0

SG(sn, k)yktn,

  • k=1
  • 1 − t

as

k

  • 1 − (y+1)t

as

k

=

  • n=0

n

  • k=0

S∗

G(sn, k)yktn

slide-15
SLIDE 15

Hypergeometric Zeta

The hypergeometric zeta function is defined by ζa,b (s) =

  • k≥1

1 zs

a,b;k

, where za,b;k are the zeros of the classic Kummer (confluent hypergeometric) function Φa,b (z) := 1F1

  • a

a + b ; z

  • .

The zeros za,b;k are pair-wise complex conjugated.

slide-16
SLIDE 16

Hypergeometric Zeta

For a = 1, b = 0, we have Φ1,0 (z) =1 F1 1 1 ; z

  • = ez.

For b = a, we have Φa,a (z) = 1F1 a 2a ; z

  • = e

z 2 22a−1Γ

  • a + 1

2 Ia− 1

2 (z)

za− 1

2

.

slide-17
SLIDE 17

Hypergeometric Zeta

This function has the Weierstrass factorization

1F1

  • a

a + b ; z

  • = e

a a+b z

k≥1

  • 1 −

z za,b;k

  • e

z za,b;k .

slide-18
SLIDE 18

Hypergeometric Zeta

This function has the Weierstrass factorization

1F1

  • a

a + b ; z

  • = e

a a+b z

k≥1

  • 1 −

z za,b;k

  • e

z za,b;k .

We deduce a (nontrivial) generating function for ζa,b (s) as

  • k=1

ζa,b (k + 1) zk = b a + b Φa,b+1 (z) Φa,b (z) − 1

  • .
slide-19
SLIDE 19

Hypergeometric Zeta

This function has the Weierstrass factorization

1F1

  • a

a + b ; z

  • = e

a a+b z

k≥1

  • 1 −

z za,b;k

  • e

z za,b;k .

We deduce a (nontrivial) generating function for ζa,b (s) as

  • k=1

ζa,b (k + 1) zk = b a + b Φa,b+1 (z) Φa,b (z) − 1

  • .

Moreover, from the Weierstrass factorization we deduce

1F1

  • a

a + b ; ız

  • 1F1
  • a

a + b ; −ız

  • =
  • k≥1
  • 1 +

z2 z2

a,b;k

  • .

We need an identity originally due to Ramanujan [1, Entry 18, p.61] and later proved by Preece.

slide-20
SLIDE 20

Hypergeometric Zeta

Lemma

We have the identity

1F1

  • a

a + b ; ız

  • 1F1
  • a

a + b ; −ız

  • = 2F3
  • a, b

a + b, a+b

2 , a+b+1 2

; −z2 4

  • .

The multiple zeta value ζa,b ({2}n) can be deduced as ζa,b ({2}n) = (−1)n n! (a)n (b)n (a + b)n (a + b)2n . For example, ζa,b ({2}) = − ab (a + b)2 (a + b + 1)

slide-21
SLIDE 21

Hypergeometric Zeta

The values of ζa,b({2r}n) for r = 1, 2, . . . can be recursively computed from ζa,b({2}n) using the following general result.

Theorem

Take m ∈ Z, m > 0 and ω a primitive m−th root of unity. Then ζG({ms}n) = (−1)n(m−1)

  • l0+l1+···+lm−1=mn

m−1

  • j=0

ζG({s}lj)ωjlj.

slide-22
SLIDE 22

Hypergeometric Zeta

Proof.

Start with the identity 1 − zm = m−1

j=0 (1 − zωj) for m > 0, so that ∞

  • n=0

(−1)nζG({ms}n)tmn =

  • k=1
  • 1 − tm

ams

k

  • =

  • k=1

m−1

  • j=0
  • 1 − tωj

as

k

  • =

m−1

  • j=0

  • k=1
  • 1 − tωj

as

k

  • =

m−1

  • j=0

  • n=0

ωjn(−1)nζG({s}n)tn

  • .
slide-23
SLIDE 23

Hypergeometric Zeta

Theorem

The multiple zeta value ζa,b ({4}n) is equal to ζa,b ({4}n) = (−1)n (2n)! (a)2n (b)2n (a + b)2n (a + b)4n ×6F5 −2n, 1 − 2n − a − b, 1 − 2n − a+b

2 , 1 − 2n − a+b+1 2

, a, b 1 − 2n − a, 1 − 2n − b, a + b, a+b

2 , a+b+1 2

; −1

  • For example,

ζa,b ({4}) = −ab(a3 + a2(1 − 2b) + b2(1 + b) − 2ab(2 + b) (a + b)4(1 + a + b)2(2 + a + b)(3 + a + b) .

slide-24
SLIDE 24

Hypergeometric Zeta

Proof.

We want to compute ζa,b ({4}n) from the generating function

  • n≥0

ζa,b ({4}n) z4n =

  • k≥1
  • 1 +

z4 z4

a,b;k

  • =
  • k≥1
  • 1 + (√ız)2

z2

a,b;k k≥1

  • 1 + (ı√ız)2

z2

a,b;k

  • .

Since

k≥1

  • 1 +

z2 z2

a,b;k

  • = 2F3
  • a, b

a + b, a+b

2 , a+b+1 2

; − z2

4

  • , we

deduce

  • n≥0

ζa,b ({4}n) z4n = 2F3

  • a, b

a + b, a+b

2 , a+b+1 2

; −ız2 4

  • 2F3
  • a, b

a + b, a+b

2 , a+b+1 2

; ız2 4

  • .
slide-25
SLIDE 25

Hypergeometric Zeta

Proof.

We have

2F3

  • a1, a2

b1, b2, b3 ; cz

  • 2F3
  • α1, α2

β1, β2, β3 ; dz

  • =
  • k≥0

zk k! dk (α1)k (α2)k (β1)k (β2)k (β3)k × 6F5 −k, 1 − k − β1, 1 − k − β2, 1 − k − β3, a1, a2 1 − k − α1, 1 − k − α2, b1, b2, b3 ; c d

  • .
slide-26
SLIDE 26

Hypergeometric Zeta

Proof.

We have

2F3

  • a1, a2

b1, b2, b3 ; cz

  • 2F3
  • α1, α2

β1, β2, β3 ; dz

  • =
  • k≥0

zk k! dk (α1)k (α2)k (β1)k (β2)k (β3)k × 6F5 −k, 1 − k − β1, 1 − k − β2, 1 − k − β3, a1, a2 1 − k − α1, 1 − k − α2, b1, b2, b3 ; c d

  • .

Therefore our desired hypergeometric product is

  • n≥0

z2n n! ı 4 n (a)n (b)n (a + b)n a+b

2

  • n

a+b+1

2

  • n

×6F5 −n, 1 − n − a − b, 1 − n − a+b

2 , 1 − n − a+b+1 2

, a, b 1 − n − a, 1 − n − b, a + b, a+b

2 , a+b+1 2

; −1

slide-27
SLIDE 27

Hypergeometric Zeta *

We want to compute now ζ∗

a,b ({2}n) with generating function

  • n≥0

ζ∗

a,b ({2}n) z2n =

  • k≥1
  • 1 −

z2 z2

a,b;k

−1 = 1

1F1

  • a

a + b ; z

  • 1F1
  • a

a + b ; −z .

slide-28
SLIDE 28

Hypergeometric Zeta *

We want to compute now ζ∗

a,b ({2}n) with generating function

  • n≥0

ζ∗

a,b ({2}n) z2n =

  • k≥1
  • 1 −

z2 z2

a,b;k

−1 = 1

1F1

  • a

a + b ; z

  • 1F1
  • a

a + b ; −z . Let us introduce the hypergeometric Bernoulli numbers B(a,b)

n

, defined through their generating function

  • n≥0

B(a,b)

n

n! zn = 1

1F1

  • a

a + b ; z .

slide-29
SLIDE 29

Hypergeometric Zeta

We have

  • k≥1
  • 1 −

z2 z2

a,b;k

−1 =

  • k,l≥0

B(a,b)

k

B(a,b)

l

k!l! (−1)k zk+l =

  • n≥0

zn n!

n

  • k=0

n k

  • (−1)k B(a,b)

k

B(a,b)

n−k .

so that ζ∗

a,b ({2}n) = 2n

  • k=0

2n k

  • (−1)k B(a,b)

k

B(a,b)

2n−k.

For example, ζ∗

a,b ({2}) = −

ab (a + b)2 (1 + a + b) = ζa,b ({2}) and ζ∗

a,b

  • {2}2

= ab

  • −a2 − a3 − b2 − b3 + ab (a + b + 5) (a + b + 2)
  • 2(a + b)4(1 + a + b)2(2 + a + b)(3 + a + b)

.

slide-30
SLIDE 30

Hypergeometric Zeta

Theorem

The hypergeometric Bernoulli numbers satisfy the linear recurrence

n

  • k=0

a + b + n − 1 k a − 1 + n − k n − k

  • B(a,b)

k

= (a + b)n δn, with initial condition B(a,b) = 1.

slide-31
SLIDE 31

Hypergeometric Zeta

Theorem

The hypergeometric Bernoulli numbers satisfy the linear recurrence

n

  • k=0

a + b + n − 1 k a − 1 + n − k n − k

  • B(a,b)

k

= (a + b)n δn, with initial condition B(a,b) = 1. This recurrence is a consequence of the identity H (t) E (−t) = 1 and allows us to explicitly compute B(a,b)

n

in terms of the lower-order numbers

  • B(a,b)

k

  • k<n, and in turn to deduce the values
  • f ζ∗

a,b ({2p}n).

slide-32
SLIDE 32

Bessel Zeta

Consider jν(z) := 2νΓ(ν + 1)Jν(z) zν , with the Weierstrass factorization jν(z) =

  • k=1
  • 1 − z2

z2

ν,k

  • , ∀z ∈ C.
slide-33
SLIDE 33

Bessel Zeta

Consider jν(z) := 2νΓ(ν + 1)Jν(z) zν , with the Weierstrass factorization jν(z) =

  • k=1
  • 1 − z2

z2

ν,k

  • , ∀z ∈ C.

Frappier developed an extensive theory centered around these

  • functions. This led him to define a family of Bernoulli polynomials

Bn,ν (x) called "α-Bernoulli polynomials" with the generating function e(x− 1

2 )z

jν( iz

2 ) = ∞

  • n=0

Bn,ν(x) n! zn.

slide-34
SLIDE 34

Hypergeometric Zeta

The case ν = 1

2 recovers the Riemann zeta function since

j 1

2 (z) = sin z

z =

  • k≥1
  • 1 −

z2 k2π2

  • ,

z 1

2,k = kπ, ζB, 1 2 (s) = 1

πs ζ (s) , Bn, 1

2 (z) = Bn (z) .

slide-35
SLIDE 35

Hypergeometric Zeta

The case ν = 1

2 recovers the Riemann zeta function since

j 1

2 (z) = sin z

z =

  • k≥1
  • 1 −

z2 k2π2

  • ,

z 1

2,k = kπ, ζB, 1 2 (s) = 1

πs ζ (s) , Bn, 1

2 (z) = Bn (z) .

The case ν = − 1

2 corresponds to

j− 1

2 (z) = cos z =

  • k≥1
  • 1 −

z2

  • k + 1

2

2 π2

  • ,

z− 1

2 ,k =

  • k + 1

2

  • π, ζB,− 1

2 (s) = 2s − 1

πs ζ (s) and Bn,− 1

2 (z) coincides with the Euler polynomial En (z)

  • n≥0

En (z) n! xn = 2exz ex + 1.

slide-36
SLIDE 36

Hypergeometric Zeta

Theorem

The following evaluations hold for the zeta function built out of the Bessel zeros: ζB,ν({2}n) = 1 22nn!(ν + 1)n , ζ∗

B,ν({2}n) = B2n,ν( 1 2)

(2n)! 22n(−1)n, SB,ν(2n, k) =

n

  • r=k

(−1)n−k r k 22n−4rΓ(ν + 1)B2n−2r,ν 1

2

  • r!(2n − 2r)!Γ(ν + r + 1) ,

S∗

B,ν(2n, k) = (−1)n n

  • r=k

r k

  • Γ(ν + 1)B2r,ν

1

2

  • 22n−4r(n − r)!(2r)!Γ(ν + n − r + 1).
slide-37
SLIDE 37

Hypergeometric Zeta

Theorem

The following evaluation holds: ζB,ν({4}n) = 1 24nn! (ν + 1)2n (ν + 1)n .

slide-38
SLIDE 38

Hypergeometric Zeta

Theorem

The following evaluation holds: ζB,ν({4}n) = 1 24nn! (ν + 1)2n (ν + 1)n .

Proof.

Dissect the generating product as follows:

  • n=0

(−1)nζB,v({4}n)t2n =

  • k=1
  • 1 − t2

z4

ν,k

  • =

  • n=0

(−1)nζB,v({2}n)tn

  • n=0

ζB,v({2}n)tn.

slide-39
SLIDE 39

Hypergeometric Zeta

Proof.

Comparing coefficients of tn yields ζB,ν({4}n) = (−1)n

2n

  • l=0

(−1)lζB,ν({2}l)ζB,ν({2}2n−l)) =(−1)n

2n

  • l=0

(−1)l Γ2(ν + 1) 24n(2n − l)!l!Γ(ν + l + 1)Γ(ν + 2n − l + 1).

slide-40
SLIDE 40

Hypergeometric Zeta

Proof.

Comparing coefficients of tn yields ζB,ν({4}n) = (−1)n

2n

  • l=0

(−1)lζB,ν({2}l)ζB,ν({2}2n−l)) =(−1)n

2n

  • l=0

(−1)l Γ2(ν + 1) 24n(2n − l)!l!Γ(ν + l + 1)Γ(ν + 2n − l + 1). This sum is now identified as a Gauss hypergeometric function ζB,ν({4}n) = (−1)nΓ(ν + 1) 24n(2n)!Γ(2n + ν + 1) 2F1 −2n, −2n − ν ν + 1 ; −1

  • ,

which can be evaluated using Kummer’s identity as

2F1

−2n, −2n − ν ν + 1 ; −1

  • = (−1)n 2Γ(ν + 1)Γ(2n)

Γ(n + ν + 1)Γ(n).

slide-41
SLIDE 41

Krein’s expansion and an extension of Euler’s identity

Theorem

Define the alternate Bessel zeta function ˜ ζν as ˜ ζν (r) =

  • k≥1

1 jν+1 (zν,k) zr+2

ν,k

.

slide-42
SLIDE 42

Krein’s expansion and an extension of Euler’s identity

Theorem

Define the alternate Bessel zeta function ˜ ζν as ˜ ζν (r) =

  • k≥1

1 jν+1 (zν,k) zr+2

ν,k

. Then for n ≥ ν

2 + 1 4

  • + 1, the Bessel-Bernoulli polynomials can be

expressed as (−1)n 22n 2n! B2n,ν 1 2

  • = 4 (ν + 1) ˜

ζν (2n) .

slide-43
SLIDE 43

Krein’s expansion and an extension of Euler’s identity

Theorem

Define the alternate Bessel zeta function ˜ ζν as ˜ ζν (r) =

  • k≥1

1 jν+1 (zν,k) zr+2

ν,k

. Then for n ≥ ν

2 + 1 4

  • + 1, the Bessel-Bernoulli polynomials can be

expressed as (−1)n 22n 2n! B2n,ν 1 2

  • = 4 (ν + 1) ˜

ζν (2n) . The case ν = 1

2 recovers Euler’s identity

(2π)2n 2 (2n)! (−1)n−1 B2n = ζ (2n) .

slide-44
SLIDE 44

Krein’s expansion and an extension of Euler’s identity

Howard proved ζr+ 1

2 (2n − 2r + 2) = (−1)n 22n−2r+1 (2r + 1)!

r!

r−1

  • j=0

(2r − j − 2)! j! (r − j − 1)! B2n−j+1,r (2n − j + 1)! generalized by K. Dilcher to the confluent case ζa,b (n − a − b + 1) = (−1)b+1 (a + b + 1)! n! (a + b) ×  

a−1

  • j=0

n j a + b − j − 2 b − 1

  • B(a,b)

n−j

− (−1)n

b−1

  • j=0

n j a + b − j − 2 a − 1

  • B(a,b)

n−j

 

slide-45
SLIDE 45

Hypergeometric Zeta

Proof.

Define p := ν 2 + 1 4

  • + 1,

We have Krein’s expansion zν Jν (z) = Pp (z) − 2z2p

k≥1

1 Jν+1 (zν,k) z2p−ν−1

ν,k

  • z2 − z2

ν.k

, where Pp (z) is the polynomial of degree 2p − 2 defined as the truncated Taylor expansion at 0 of

zν Jν(z):

Pp (z) =

p−1

  • m=0

d2m dz2m

Jν (z)

  • |z=0

z2m 2m!.

slide-46
SLIDE 46

Hypergeometric Zeta

Proof.

Now take |z| < |zν,1|, the smallest zero of Jν, so that 1 z2p−ν−1

ν,k

  • z2 − z2

ν.k

= − 1 z2p−ν+1

ν,k

  • 1 − z2

z2

ν.k

= −

  • q≥0

z2q z2q+2p−ν+1

ν,k

and the infinite sum in Krein’s expansion is

  • k≥1

−2z2p−ν Jν+1 (zν,k) z2p−ν−1

ν,k

  • z2 − z2

ν.k

= 2

  • q≥0

z2p+2q−ν

k≥1

1 Jν+1 (zν,k) z2q+2p−ν+1

ν,k

Using the definition of the alternate Bessel zeta function, we obtain 1 jν (z) = Pp (z) 2νΓ (ν + 1) + 4 (ν + 1)

  • q≥0

z2p+2q ˜ ζν (2q + 2p) .

slide-47
SLIDE 47

Hypergeometric Zeta

Remark : Since ζ∗

B,ν({2}n) = B2n,ν( 1 2)

(2n)! 22n(−1)n, we also have ζ∗

B,ν({2}n) = 4 (ν + 1) ˜

ζν (2n) ,

  • r
  • k1≥k2≥···≥kn≥1

1 z2

ν,k1 · · · z2 ν,kn

= 4 (ν + 1)

  • k≥1

1 jν+1 (zν,k) z2n+2

ν,k

.

slide-48
SLIDE 48

A Bessel-Gessel-Viennot identity

In [19], Hoffman uses generating functions to express the average S (2n, k) in two different ways (in the case ν = 1

2). This yields, for

k ≤ n, ⌊ k−1

2 ⌋

  • i=0

2k − 2i − 1 k 2n + 1 2i + 1

  • B2n−2i = (−1)n−k

(2n + 1)!

n−k

  • i=0

n − i k 2n + 1 2i

  • 22iB2i
slide-49
SLIDE 49

A Bessel-Gessel-Viennot identity

In [19], Hoffman uses generating functions to express the average S (2n, k) in two different ways (in the case ν = 1

2). This yields, for

k ≤ n, ⌊ k−1

2 ⌋

  • i=0

2k − 2i − 1 k 2n + 1 2i + 1

  • B2n−2i = (−1)n−k

(2n + 1)!

n−k

  • i=0

n − i k 2n + 1 2i

  • 22iB2i

This a variation of the Gessel-Viennot identity ⌊ k−1

2 ⌋

  • i=0

2k − 2i − 1 k 2n + 1 2i + 1

  • B2n−2i = 2n + 1

2 2k − 2n k

  • , k > n,

that is valid on the complementary range k > n.

slide-50
SLIDE 50

A Bessel-Gessel-Viennot identity

Theorem

The average SB,ν(2n, k) can be expressed as, for k ≤ n, SB,ν(2n, k) =

n

  • r=k

(−1)n−k r k

  • 22n−4rΓ(ν + 1)

r!(2n − 2r)!Γ(ν + r + 1)B2n−2r,ν 1 2

  • ,
  • r alternatively as, still for k ≤ n,

SB,ν(2n, k) = 1 k! ⌊ k−1

2 ⌋

  • j=0

(−1)j 22j k − 1 − j j Γ (ν + k − j) Γ (ν + 1 + j)ζν (2n − 2j) . The case ν = 1

2 recovers Hoffman’s identity.

slide-51
SLIDE 51

A Bessel-Gessel-Viennot identity

The proof of this result uses generating functions. It gives us as a by-product another identity valid for k+1

2

  • < n ≤ k − 1,

⌊ k−1

2 ⌋

  • j=0

(−1)j 22j k − 1 − j j Γ (ν + k − j) Γ (ν + 1 + j)ζν (2n − 2j) = 0.

slide-52
SLIDE 52

A Bessel-Gessel-Viennot identity

Consider the Lommel polynomials, that enter in the decomposition Jν+1 (z) = 2ν z Jν (z) − Jν−1 (z)

slide-53
SLIDE 53

A Bessel-Gessel-Viennot identity

Consider the Lommel polynomials, that enter in the decomposition Jν+1 (z) = 2ν z Jν (z) − Jν−1 (z) Jν+2 (z) = 2 (ν + 1) z 2ν z Jν (z) − 2 (ν + 1) z Jν−1 (z) − Jν (z) = 2 (ν + 1) z 2ν z − 1

  • Jν (z) − 2 (ν + 1)

z Jν−1 (z)

slide-54
SLIDE 54

A Bessel-Gessel-Viennot identity

Consider the Lommel polynomials, that enter in the decomposition Jν+1 (z) = 2ν z Jν (z) − Jν−1 (z) Jν+2 (z) = 2 (ν + 1) z 2ν z Jν (z) − 2 (ν + 1) z Jν−1 (z) − Jν (z) = 2 (ν + 1) z 2ν z − 1

  • Jν (z) − 2 (ν + 1)

z Jν−1 (z) More generally jν+m (z) = Rm−1,ν+1 (z) z

2

m−1 (ν + 2)m−1 jν+1 (z)−Rm−2,ν+2 (z) z

2

m (ν + 1)m jν (z) .

slide-55
SLIDE 55

A Bessel-Gessel-Viennot identity

For example R0,ν (z) = 1, R1,ν = 2ν z , R2,ν = 4ν (ν + 1) z2 . . . and Rn,ν (z) = ⌊ n

2⌋

  • j=0

(−1)j n − j j Γ (ν + n − j) Γ (ν + j) z 2 2j−n .

slide-56
SLIDE 56

A Bessel-Gessel-Viennot identity

For example R0,ν (z) = 1, R1,ν = 2ν z , R2,ν = 4ν (ν + 1) z2 . . . and Rn,ν (z) = ⌊ n

2⌋

  • j=0

(−1)j n − j j Γ (ν + n − j) Γ (ν + j) z 2 2j−n . The Lommel polynomials are orthogonal with respect to the discrete measure ρ (z) =

  • n≥1

1 z2

ν−1,n

  • δ
  • z −

1 zν−1,n

  • + δ
  • z +

1 zν−1,n

slide-57
SLIDE 57

A Bessel-Gessel-Viennot identity

For example R0,ν (z) = 1, R1,ν = 2ν z , R2,ν = 4ν (ν + 1) z2 . . . and Rn,ν (z) = ⌊ n

2⌋

  • j=0

(−1)j n − j j Γ (ν + n − j) Γ (ν + j) z 2 2j−n . The Lommel polynomials are orthogonal with respect to the discrete measure ρ (z) =

  • n≥1

1 z2

ν−1,n

  • δ
  • z −

1 zν−1,n

  • + δ
  • z +

1 zν−1,n

  • +∞

−∞

Rr,ν 1 x

  • Rs,ν

1 x

  • ρ (x) dx =

δr,s 2 (ν + r).

slide-58
SLIDE 58

A Bessel-Gessel-Viennot identity

Choosing s ∈ [0, r] and expressing xs as a linear combination of the polynomials Rr,ν yields

+∞

  • q=1

Rr,ν (zν−1,q) zs+2

ν−1,q

= Γ (ν) 2r+2Γ (ν + r + 1)δr,s, 0 ≤ s ≤ r,

slide-59
SLIDE 59

A Bessel-Gessel-Viennot identity

Choosing s ∈ [0, r] and expressing xs as a linear combination of the polynomials Rr,ν yields

+∞

  • q=1

Rr,ν (zν−1,q) zs+2

ν−1,q

= Γ (ν) 2r+2Γ (ν + r + 1)δr,s, 0 ≤ s ≤ r, This is equivalent to ⌊ k−1

2 ⌋

  • j=0

(−1)j 22j k − 1 − j j Γ (ν + k − j) Γ (ν + 1 + j)ζν (2n − 2j) = 0, k + 1 2

  • < n ≤ k−1.
slide-60
SLIDE 60

Airy Zeta function

The Airy function has Weierstrass factorization Ai (z) = Ai (0) e

Ai′(0) Ai(0) z

n≥1

  • 1 − z

an

  • e

z an ,

where all the zeros {an} are real and negative. We frequently use the constants Ai (0) = 1 3

2 3 Γ

2

3

, Ai′ (0) = − 1 3

1 3 Γ

1

3

.

Theorem

The Airy MZV is equal to ζAi ({2}n) = 1 12

n 3 n!

5

6

  • n

3

.

slide-61
SLIDE 61

Airy Zeta function

The usual proof uses the series expansion Ai (x) Ai (−x) = 2 √π

  • n≥0

(−1)n x2n 12

2n+5 6 n!Γ

2n+5

6

, deduced by Reid as a consequence of the integral representation Ai (x) Ai (−x) = 1 π2

1 3

+∞

−∞

Ai

  • 2− 4

3 t2

cos (xt) dt.

slide-62
SLIDE 62

Airy Zeta function

The usual proof uses the series expansion Ai (x) Ai (−x) = 2 √π

  • n≥0

(−1)n x2n 12

2n+5 6 n!Γ

2n+5

6

, deduced by Reid as a consequence of the integral representation Ai (x) Ai (−x) = 1 π2

1 3

+∞

−∞

Ai

  • 2− 4

3 t2

cos (xt) dt. Then the Weierstrass factorization allows to deduce the generating function of ζAi ({2} n) as

  • n=0

ζAi ({2}n) zn =

  • n≥1
  • 1 + z

a2

n

  • = Ai
  • ı√z
  • Ai
  • −ı√z
  • Ai (0)2

.

slide-63
SLIDE 63

Airy Zeta function

We observe that ζB,− 1

3 ({4}n) =

3 2 4n ζAi

  • {2}3n

. This is not a coincidence.

slide-64
SLIDE 64

Airy Zeta function

We observe that ζB,− 1

3 ({4}n) =

3 2 4n ζAi

  • {2}3n

. This is not a coincidence.

Theorem

The Airy MZV and the Bessel MZV are related by ζAi

  • {2}3n

= 2 3 4n ζB,− 1

3 ({4}n)

and ζAi

  • {2}3n+1

ζAi ({2}) = 2 3 4n ζB, 1

3 ({4}n) .

slide-65
SLIDE 65

Airy Zeta function

Proof.

The Airy function is an entire function: with ξ = 2

3z

3 2

Ai (z) =

  • n≥0

anzn = √z 3

  • I− 1

3 (ξ) − I 1 3 (ξ)

  • such that a3n+2 = 0. The coefficients a3n are provided by the term

√z 3 I− 1

3 (ξ), while the coefficients a3n+1 arise from

√z 3 I 1

3 (ξ).

Similarly, the two terms in the expansion Ai (−z) = √z 3

  • J− 1

3 (ξ) − J 1 3 (ξ)

  • provide the coefficients a3n and a3n+1 respectively.

We deduce

  • n≥0

(−1)n ζAi

  • {2} 3n 3z

2 4n = j− 1

3 (ız) j− 1 3 (z) ,

slide-66
SLIDE 66

Airy Zeta function

Theorem

The values of ζAi ({4}n) can be computed as the convolution ζAi ({4}n) =

2n

  • k=0

1 12k122n−k (−1)k k!(2n − k)! 1 5

6

  • k

3

5

6

  • 2n−k

3

slide-67
SLIDE 67

Airy Zeta function

Theorem

The values of ζAi ({4}n) can be computed as the convolution ζAi ({4}n) =

2n

  • k=0

1 12k122n−k (−1)k k!(2n − k)! 1 5

6

  • k

3

5

6

  • 2n−k

3

and are equal to ζAi ({4}n) = 1 122n Γ2 5 6 4F3

  • 2

3− 2n 3 , 5 6− 2n 3 ,1− 2n 3 , 4 3− 2n 3 4 3 , 3 2, 5 3

; −1

  • √πΓ

2n

3 + 1 6

  • Γ(2n − 1)

− 6 122n Γ2 5 6 4F3

  • 1

3 − 2n 3 , 1 2 − 2n 3 , 2 3 − 2n 3 ,1− 2n 3 2 3 , 7 6, 4 3

; −1

  • Γ

1

6

  • Γ

2n

3 + 1 2

  • Γ(2n)

+ 1 122n Γ 5 6 4F3

  • 1

6 − 2n 3 , 1 3 − 2n 3 , 2 3 − 2n 3 ,− 2n 3 1 3, 2 3 , 5 6

; −1

  • Γ

2n

3 + 5 6

  • Γ(2n + 1)

.

slide-68
SLIDE 68

Airy Bernoulli numbers

Define the Airy Bernoulli numbers Bn by the generating function

  • n≥0

Bn n! zn = Ai (0) Ai (z).

slide-69
SLIDE 69

Airy Bernoulli numbers

Define the Airy Bernoulli numbers Bn by the generating function

  • n≥0

Bn n! zn = Ai (0) Ai (z). For example, B0 = 1, B1 = 3

1 3 Γ

2

3

  • Γ

1

3

= −Ai′ (0) Ai (0) , B2 2! = B2

1 = 3

2 3 Γ2 2

3

  • Γ2 1

3

, B3 3! = −1 6 + 3Γ3 2

3

  • Γ3 1

3

, B4 4! = −3

1 3

4 Γ 2

3

Γ3 2

3

  • − 12Γ3 1

3

  • Γ4 1

3

slide-70
SLIDE 70

Airy Bernoulli numbers

Theorem

Define the sequence a3n = (−1)n (3n)! 32nn! 2

3

  • n

, a3n+1 = (−1)n+1 Γ 2

3

  • (3n + 1)!

32n+ 2

3 n!Γ

  • n + 4

3

  • , a3n+2 = 0.

The Airy Bernoulli numbers satisfy the linear recurrence

n

  • k=0

n k

  • Bkan−k = n!δn

so that Bn =

  • − n−1

k=0

n

k

  • Bkan−k,

n > 0 1 n = 0 .

slide-71
SLIDE 71

Airy Bernoulli numbers

Taking the derivative of

  • n≥0

Bn n! zn = Ai (0) Ai (z). and writing − Ai (0) Ai′ (z) Ai2 (z) = −Ai (0) Ai (z) Ai′ (z) Ai (z) . yields Bn+1 n! = −Ai′ (0) Ai (0) Bn n! +

n−1

  • r=0

Br r! ζAi (n + 1 − r) , n ≥ 1, so that ζAi (n + 1) = Ai′ (0) Ai (0) Bn n! + Bn+1 n! −

n−1

  • r=1

Br r! ζAi (n + 1 − r) , n ≥ 1.

slide-72
SLIDE 72

Airy Zeta function: there is more

M Belloni and R W Robinett, Constraints on Airy function zeros from quantum-mechanical sum rules , J. Phys. A: Math. Theor. 42 (2009) 075203. Question: how to evaluate Sp (n) =

  • k=n

1 (zk − zn)p , Tp,q,r (n) =

  • k=j=n

1 (zk − zn)p (zk − zj)q (zj − zn)r Consider the quantum bouncer V (x) =

  • k.x

x ≥ 0 +∞ x < 0

slide-73
SLIDE 73

Airy Zeta function

5 10 15 20 2 3 4 5 6 7 8

slide-74
SLIDE 74

Airy Zeta function

The solution ψn with energy En of the Schrodinger equation − 2 2m d2 dx2 ψn (x) + V (x) ψn (x) = Enψn (x) is ψn (x) = Ai (x + zn) | Ai′ (zn) | , En ∝ −zn.

slide-75
SLIDE 75

Airy Zeta function

The solution ψn with energy En of the Schrodinger equation − 2 2m d2 dx2 ψn (x) + V (x) ψn (x) = Enψn (x) is ψn (x) = Ai (x + zn) | Ai′ (zn) | , En ∝ −zn. The solutions {ψn}n≥0 form a complete set of orthonormal functions: +∞ ψn (z) ψk (z) dz = δn,k.

slide-76
SLIDE 76

Airy Zeta function

The solution ψn with energy En of the Schrodinger equation − 2 2m d2 dx2 ψn (x) + V (x) ψn (x) = Enψn (x) is ψn (x) = Ai (x + zn) | Ai′ (zn) | , En ∝ −zn. The solutions {ψn}n≥0 form a complete set of orthonormal functions: +∞ ψn (z) ψk (z) dz = δn,k. With quantum notations n|1|k = δn,k, n|f (z) |k = +∞ ψn (z) ψk (z) f (z) dz.

slide-77
SLIDE 77

Airy Zeta function

Goodmanson gave a recurrence for these moments p! (p − 4)!

  • n|xp−4|k
  • + 4p (p − 1) zn + zk

2

  • n|xp−2|k
  • −2p (2p − 1)
  • n|xp−1|k
  • + (zn − zk)2 n|xp|k = 2δ1,p (−1)n−k+1
slide-78
SLIDE 78

Airy Zeta function

Goodmanson gave a recurrence for these moments p! (p − 4)!

  • n|xp−4|k
  • + 4p (p − 1) zn + zk

2

  • n|xp−2|k
  • −2p (2p − 1)
  • n|xp−1|k
  • + (zn − zk)2 n|xp|k = 2δ1,p (−1)n−k+1

For example, n|x|n = 2 3zn,

  • n|x2|n
  • = 8

15z2

n,

  • n|x3|n
  • = 16

35z3

n + 3

7 . . .

slide-79
SLIDE 79

Airy Zeta function

Goodmanson gave a recurrence for these moments p! (p − 4)!

  • n|xp−4|k
  • + 4p (p − 1) zn + zk

2

  • n|xp−2|k
  • −2p (2p − 1)
  • n|xp−1|k
  • + (zn − zk)2 n|xp|k = 2δ1,p (−1)n−k+1

For example, n|x|n = 2 3zn,

  • n|x2|n
  • = 8

15z2

n,

  • n|x3|n
  • = 16

35z3

n + 3

7 . . . and n|x|k = 2 (−1)n−k+1 (zk − zn)2 ,

  • n|x2|k
  • = 24 (−1)n−k+1

(zk − zn)4 ,

  • n|x3|n
  • = (−1)n−k+1
  • 720

(zk − zn)6 − 48zn (zk − zn)4 − 24 (zk − zn)3

  • . . .
slide-80
SLIDE 80

Airy Zeta function

Next use the Thomas-Reiche-Khun rule

  • k=n

(En − Ek) | n|x|k |2 = 2 2m and Ek = −zk to deduce

  • k=n

(zk − zn) 4 (zk − zn)4 = 1 so that S3 (n) =

  • k=n

1 (zk − zn)3 = 1 4.

slide-81
SLIDE 81

Airy Zeta function

To obtain S4 (n) , write the closure relationship

  • all k

n|x|k k|x|n =

  • n|x2|n
  • so that

| n|x|n |2 +

  • k=n

4 (zk − zn)4 = 8 15z2

n =

⇒ S4 (n) = z2

n

45

slide-82
SLIDE 82

Airy Zeta function

Moreover, using

  • all k
  • all j

n|x|k k|x|j j|x|n =

  • n|x3|n
  • gives

T2,2,2 (n) =

  • k=j=n

1 (zk − zn)2 (zk − zj)2 (zj − zn)2 = 2 945z3

n +

5 168. Compare to

  • m,n≥1

1 m2n2 (m + n)2 = π6 2835.

slide-83
SLIDE 83

Bruce C. Berndt, Ramanujan’s Notebooks, Part II, 1989, Springer

  • D. J. Broadhurst and D. Kreimer, Association of multiple zeta

values with positive knots via Feynman diagrams up to 9 loops,

  • Phys. Lett. B 393: 3-4 (1997) 403-412.
  • Y. A. Brychkov, Handbook of special functions, Derivatives,

integrals, series and other formulas, CRC Press, Boca Raton, FL, 2008.

  • A. Byrnes, V. Moll, and C. Vignat, Recursion rules for the

hypergeometric zeta function Int. J. Number Theory 10 (2014), 1761–1782. K.-W. Chen, C.-L. Chung and M. Eie, Sum formulas of multiple zeta values with arguments multiples of a common positive integer, J. Number Theory, Volume 177, August 2017, pages 479–496 C.-L. Chung, On the sum relation of multiple hurwitz zeta

  • functions. Quaestiones Mathematicae, 03, (2018), 1–9.
slide-84
SLIDE 84
  • R. E. Crandall, On the quantum zeta function, J. Phys. A:
  • Math. Gen. 29 (1996) 6795–6816
  • D. Dickinson, On Lommel and Bessel polynomials, Proceedings
  • f the American Mathematical Society, 5-6, 946, 1954
  • S. Ding, L. Feng and W. Liu, A combinatorial identity of

multiple zeta values with even arguments, The Electronic Journal of Combinatorics, 21-2 (2014) 2–27.

  • P. Dunin-Barkowski, A. Sleptsov, and A. Smirnov, Kontsevich

integral for knots and Vassiliev invariants, Internat. J. Modern

  • Phys. A 28: 17 (2013) 1330025, 38.
  • P. Flajolet and G. Louchard, Analytic Variations on the Airy

Distribution, Algorithmica (2001) 31: 361–377

  • C. Frappier, A unified calculus using the generalized Bernoulli

polynomials, J. Approx. Theory 2 (2001), 279–313.

  • M. Genčev, On restricted sum formulas for multiple zeta values

with even arguments, Arch. Math. 107, (2016), 9-22

slide-85
SLIDE 85
  • I. M. Gessel and X. G. Viennot, Determinants, paths, and plane

partitions, preprint, 1989, http://people.brandeis.edu/ ~gessel/homepage/papers/index.html I.S. Gradshteyn and I.M. Ryzhik, Table of integrals, series, and products, Seventh ed., Translated from the Russian, Elsevier/Academic Press, Amsterdam, 2007. C.C. Grosjean, The orthogonality property of the Lommel polynomials and a twofold infinity of relations between Rayleigh’s σ−sums, Journal of Computational and Applied Mathematics, 10, 355-382, 1984 G.H. Hardy, A chapter from Ramanujan’s note-book, Proc. Cambridge Phil. Soc. 21, 492-503, 21, 1923

  • R. Henderson, The Algebra of Multiple Zeta Values, Thesis,

http://citeseerx.ist.psu.edu/viewdoc/summary?doi= 10.1.1.227.5432

  • M. Hoffman, On multiple zeta values of even arguments, Intl.
  • J. Number Theory 13, 705, 2017.
slide-86
SLIDE 86
  • M. Hoffman, An odd variant of multiple zeta values, preprint,

2016, https://arxiv.org/abs/1612.05232.

  • K. Ihara, M. Kaneko, and D. Zagier, Derivation and double

shuffle relations for multiple zeta values, Compos. Math. 142: 2 (2006) 307–338.

  • I. G. Macdonald, Symmetric functions and Hall polynomials,

2nd ed., Oxford University Press, New York, 1995.

  • C. T. Preece, The Product of two Generalized Hypergeometric

Functions, Proceedings of the London Mathematical Society, s2-22, 1, 370-380, 1924 A.P. Prudnikov, Integrals Series: More Special Functions, 1990, Gordon and Breach Science Publishers.

  • W. H. Reid, Integral representations for products of Airy

functions, Z. angew. Math. Phys. 46 (1995), 159-170. V.B. Sherstyukov and E.V. Sumin, Reciprocal expansion of modified Bessel function in simple fractions and obtaining

slide-87
SLIDE 87

general summation relationships containing its zeros, Journal of Physics: Conf. Series 937, 012047, 2017 Barry Simon, Basic complex analysis, A Comprehensive Course in Analysis, Part 2A, American Mathematical Society, Providence, RI, 2015. I.N. Sneddon, On some infinite series involving the zeros of Bessel functions of the first kind, Glasgow Mathematical Journal, 4–3, 144-156, January 1960.

  • O. Vallée, M. Soares and C. de Izarra, An integral

representation for the product of Airy functions, Z. angew.

  • Math. Phys. 48, 156–160, 1997
  • G. N. Watson, A treatise on the theory of Bessel functions,

Reprint of the second (1944) edition, Cambridge University Press, Cambridge, 1995.

  • D. Zagier, Values of zeta functions and their applications, First

European Congress of Mathematics, Vol. II Paris, 1992, Vol. 120, 497–512, 1994.

slide-88
SLIDE 88
  • R. Zhang, Sums of zeros for certain special functions, Integral

Transforms and Special Functions, 21:5, 351-365, 2009

  • V. Zudilin, Algebraic relations for multiple zeta values, Russian
  • Math. Surveys, 58, (2003) 3–32.