Mittag-Leffler polynomials

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Distinguish In mathematics, the Mittag-Leffler polynomials are the polynomials gn(x) or Mn(x) studied by Template:Harvs.

Mn(x) is a special case of the Meixner polynomial Mn(x;b,c) at b = 0, c = -1.

Definition and examples

Generating functions

The Mittag-Leffler polynomials are defined respectively by the generating functions

n=0gn(x)tn:=12(1+t1t)x and
n=0Mn(x)tnn!:=(1+t1t)x=(1+t)x(1t)x=exp(2x artanh t).

They also have the bivariate generating function[1]

n=1m=1gn(m)xmyn=xy(1x)(1xyxy).

Examples

The first few polynomials are given in the following table. The coefficients of the numerators of the gn(x) can be found in the OEIS,[2] though without any references, and the coefficients of the Mn(x) are in the OEIS[3] as well.

n gn(x) Mn(x)
0 12 1
1 x 2x
2 x2 4x2
3 13(x+2x3) 8x3+4x
4 13(2x2+x4) 16x4+32x2
5 115(3x+10x3+2x5) 32x5+160x3+48x
6 145(23x2+20x4+2x6) 64x6+640x4+736x2
7 1315(45x+196x3+70x5+4x7) 128x7+2240x5+6272x3+1440x
8 1315(132x2+154x4+28x6+x8) 256x8+7168x6+39424x4+33792x2
9 12835(315x+1636x3+798x5+84x7+2x9) 512x9+21504x7+204288x5+418816x3+80640x
10 114175(5067x2+7180x4+1806x6+120x8+2x10) 1024x10+61440x8+924672x6+3676160x4+2594304x2

Properties

The polynomials are related by Mn(x)=2n!gn(x) and we have gn(1)=1 for n1. Also g2k(12)=g2k+1(12)=12(2k1)!!(2k)!!=1213(2k1)24(2k).

Explicit formulas

Explicit formulas are

gn(x)=k=1n2k1(n1nk)(xk)=k=0n12k(n1k)(xk+1)
gn(x)=k=0n1(n1k)(k+xn)
gn(m)=12k=0m(mk)(n1+mkm1)=12k=0min(n,m)mn+mk(n+mkk,nk,mk)

(the last one immediately shows ngn(m)=mgm(n), a kind of reflection formula), and

Mn(x)=(n1)!k=1nk2k(nk)(xk), which can be also written as
Mn(x)=k=1n2k(nk)(n1)nk(x)k, where (x)n=n!(xn)=x(x1)(xn+1) denotes the falling factorial.

In terms of the Gaussian hypergeometric function, we have[4]

gn(x)=x2F1(1n,1x;2;2).

Reflection formula

As stated above, for m,n, we have the reflection formula ngn(m)=mgm(n).

Recursion formulas

The polynomials Mn(x) can be defined recursively by

Mn(x)=2xMn1(x)+(n1)(n2)Mn2(x), starting with M1(x)=0 and M0(x)=1.

Another recursion formula, which produces an odd one from the preceding even ones and vice versa, is

Mn+1(x)=2xk=0n/2n!(n2k)!Mn2k(x), again starting with M0(x)=1.


As for the gn(x), we have several different recursion formulas:

(1)gn(x+1)gn1(x+1)=gn(x)+gn1(x)
(2)(n+1)gn+1(x)(n1)gn1(x)=2xgn(x)
(3)x(gn(x+1)gn(x1))=2ngn(x)
(4)gn+1(m)=gn(m)+2k=1m1gn(k)=gn(1)+gn(2)++gn(m)+gn(m1)++gn(1)

Concerning recursion formula (3), the polynomial gn(x) is the unique polynomial solution of the difference equation x(f(x+1)f(x1))=2nf(x), normalized so that f(1)=1.[5] Further note that (2) and (3) are dual to each other in the sense that for x, we can apply the reflection formula to one of the identities and then swap x and n to obtain the other one. (As the gn(x) are polynomials, the validity extends from natural to all real values of x.)

Initial values

The table of the initial values of gn(m) (these values are also called the "figurate numbers for the n-dimensional cross polytopes" in the OEIS[6]) may illustrate the recursion formula (1), which can be taken to mean that each entry is the sum of the three neighboring entries: to its left, above and above left, e.g. g5(3)=51=33+8+10. It also illustrates the reflection formula ngn(m)=mgm(n) with respect to the main diagonal, e.g. 344=433.

Template:Diagonal split header 1 2 3 4 5 6 7 8 9 10
1 1 1 1 1 1 1 1 1 1 1
2 2 4 6 8 10 12 14 16 18
3 3 9 19 33 51 73 99 129
4 4 16 44 96 180 304 476
5 5 25 85 225 501 985
6 6 36 146 456 1182
7 7 49 231 833
8 8 64 344
9 9 81
10 10

Orthogonality relations

For m,n the following orthogonality relation holds:[7]

gn(iy)gm(iy)ysinhπydy=12nδmn.

(Note that this is not a complex integral. As each gn is an even or an odd polynomial, the imaginary arguments just produce alternating signs for their coefficients. Moreover, if m and n have different parity, the integral vanishes trivially.)

Binomial identity

Being a Sheffer sequence of binomial type, the Mittag-Leffler polynomials Mn(x) also satisfy the binomial identity[8]

Mn(x+y)=k=0n(nk)Mk(x)Mnk(y).

Integral representations

Based on the representation as a hypergeometric function, there are several ways of representing gn(z) for |z|<1 directly as integrals,[9] some of them being even valid for complex z, e.g.

(26)gn(z)=sin(πz)2π11tn1(1+t1t)zdt
(27)gn(z)=sin(πz)2πeuz(tanhu2)nsinhudu
(32)gn(z)=1π0πcotz(u2)cos(πz2)cos(nu)du
(33)gn(z)=1π0πcotz(u2)sin(πz2)sin(nu)du
(34)gn(z)=12π02π(1+eit)z(2+eit)n1eintdt.

Closed forms of integral families

There are several families of integrals with closed-form expressions in terms of zeta values where the coefficients of the Mittag-Leffler polynomials occur as coefficients. All those integrals can be written in a form containing either a factor tan±n or tanh±n, and the degree of the Mittag-Leffler polynomial varies with n. One way to work out those integrals is to obtain for them the corresponding recursion formulas as for the Mittag-Leffler polynomials using integration by parts.

1. For instance,[10] define for nm2

I(n,m):=01artanhnxxmdx=01logn/2(1+x1x)dxxm=0zncothm2zsinh2zdz.

These integrals have the closed form

(1)I(n,m)=n!2n1ζn+1gm1(1ζ)

in umbral notation, meaning that after expanding the polynomial in ζ, each power ζk has to be replaced by the zeta value ζ(k). E.g. from g6(x)=145(23x2+20x4+2x6)  we get  I(n,7)=n!2n123ζ(n1)+20ζ(n3)+2ζ(n5)45  for n7.

2. Likewise take for nm2

J(n,m):=1arcothnxxmdx=1logn/2(x+1x1)dxxm=0zntanhm2zcosh2zdz.

In umbral notation, where after expanding, ηk has to be replaced by the Dirichlet eta function η(k):=(121k)ζ(k), those have the closed form

(2)J(n,m)=n!2n1ηn+1gm1(1η).

3. The following[11] holds for nm with the same umbral notation for ζ and η, and completing by continuity η(1):=ln2.

(3)0π/2xntanmxdx=cos(m2π)(π/2)n+1n+1+cos(mn12π)n!m2nζn+2gm(1ζ)+v=0ncos(mv12π)n!mπnv(nv)!2nηn+2gm(1η).

Note that for nm2, this also yields a closed form for the integrals

0arctannxxmdx=0π/2xntanmxdx+0π/2xntanm2xdx.

4. For nm2, define[12] K(n,m):=0tanhn(x)xmdx.

If n+m is even and we define hk:=(1)k12(k1)!(2k1)ζ(k)2k1πk1, we have in umbral notation, i.e. replacing hk by hk,

(4)K(n,m):=0tanhn(x)xmdx=n2m1(m1)!(h)m1gn(h).

Note that only odd zeta values (odd k) occur here (unless the denominators are cast as even zeta values), e.g.

K(5,3)=23(3h3+10h5+2h7)=7ζ(3)π2+310ζ(5)π41905ζ(7)π6,
K(6,2)=415(23h3+20h5+2h7),K(6,4)=445(23h5+20h7+2h9).

5. If n+m is odd, the same integral is much more involved to evaluate, including the initial one 0tanh3(x)x2dx. Yet it turns out that the pattern subsists if we define[13] sk:=η(k)=2k+1ζ(k)ln2(2k+11)ζ(k), equivalently sk=ζ(k)ζ(k)η(k)+ζ(k)η(1)η(k)η(1). Then K(n,m) has the following closed form in umbral notation, replacing sk by sk:

(5)K(n,m)=0tanhn(x)xmdx=n2m(m1)!(s)m2gn(s), e.g.
K(5,4)=89(3s3+10s5+2s7),K(6,3)=815(23s3+20s5+2s7),K(6,5)=845(23s5+20s7+2s9).

Note that by virtue of the logarithmic derivative ζζ(s)+ζζ(1s)=logπ12ΓΓ(s2)12ΓΓ(1s2) of Riemann's functional equation, taken after applying Euler's reflection formula,[14] these expressions in terms of the sk can be written in terms of ζ(2j)ζ(2j), e.g.

K(5,4)=89(3s3+10s5+2s7)=19{164342016315ln2+3ζ(4)ζ(4)20ζ(6)ζ(6)+17ζ(8)ζ(8)}.

6. For n<m, the same integral K(n,m) diverges because the integrand behaves like xnm for x0. But the difference of two such integrals with corresponding degree differences is well-defined and exhibits very similar patterns, e.g.

(6)K(n1,n)K(n,n+1)=0(tanhn1(x)xntanhn(x)xn+1)dx=1n+(n+1)2n(n1)!sn2gn(s).

See also

References

Template:Reflist