In mathematics, the Mittag-Leffler polynomials are the
polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An ex ...
s ''g''
''n''(''x'') or ''M''
''n''(''x'') studied by .
''M''
''n''(''x'') is a special case of the
Meixner polynomial ''M''
''n''(''x;b,c'') at ''b = 0, c = -1''.
Definition and examples
Generating functions
The Mittag-Leffler polynomials are defined respectively by the generating functions
:
and
:
They also have the bivariate generating function
:
Examples
The first few polynomials are given in the following table. The coefficients of the numerators of the
can be found in the OEIS, though without any references, and the coefficients of the
are in the OEIS as well.
:
Properties
The polynomials are related by
and we have
for
. Also
.
Explicit formulas
Explicit formulas are
:
:
:
(the last one immediately shows
, a kind of reflection formula), and
:
, which can be also written as
:
, where
denotes the falling factorial.
In terms of the Gaussian
hypergeometric function, we have
:
Reflection formula
As stated above, for
, we have the reflection formula
.
Recursion formulas
The polynomials
can be defined recursively by
:
, starting with
and
.
Another recursion formula, which produces an odd one from the preceding even ones and vice versa, is
:
, again starting with
.
As for the
, we have several different recursion formulas:
:
:
:
:
Concerning recursion formula (3), the polynomial
is the unique polynomial solution of the difference equation
, normalized so that
. Further note that (2) and (3) are dual to each other in the sense that for
, we can apply the reflection formula to one of the identities and then swap
and
to obtain the other one. (As the
are polynomials, the validity extends from natural to all real values of
.)
Initial values
The table of the initial values of
(these values are also called the "figurate numbers for the n-dimensional cross polytopes" in the OEIS) 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.
. It also illustrates the reflection formula
with respect to the main diagonal, e.g.
.
:
Orthogonality relations
For
the following orthogonality relation holds:
:
(Note that this is not a complex integral. As each
is an even or an odd polynomial, the imaginary arguments just produce alternating signs for their coefficients. Moreover, if
and
have different parity, the integral vanishes trivially.)
Binomial identity
Being a
Sheffer sequence
In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are na ...
of
binomial type
In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers \left\ in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities
:p ...
, the Mittag-Leffler polynomials
also satisfy the binomial identity
:
.
Integral representations
Based on the representation as a hypergeometric function, there are several ways of representing
for
directly as integrals, some of them being even valid for complex
, e.g.
:
:
:
:
:
.
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
or
, and the degree of the Mittag-Leffler polynomial varies with
. 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, define for
:
These integrals have the closed form
:
in umbral notation, meaning that after expanding the polynomial in
, each power
has to be replaced by the
zeta value . E.g. from
we get
for
.
2. Likewise take for
:
In umbral notation, where after expanding,
has to be replaced by the
Dirichlet eta function
In mathematics, in the area of analytic number theory, the Dirichlet eta function is defined by the following Dirichlet series, which converges for any complex number having real part > 0:
\eta(s) = \sum_^ = \frac - \frac + \frac - \frac + \c ...
, those have the closed form
:
.
3. The following holds for
with the same umbral notation for
and
, and completing by continuity
.
:
Note that for
, this also yields a closed form for the integrals
:
4. For
, define
.
If
is even and we define
, we have in umbral notation, i.e. replacing
by
,
:
Note that only odd zeta values (odd
) occur here (unless the denominators are cast as even zeta values), e.g.
:
:
5. If
is odd, the same integral is much more involved to evaluate, including the initial one
. Yet it turns out that the pattern subsists if we define
, equivalently
. Then
has the following closed form in umbral notation, replacing
by
:
:
, e.g.
:
Note that by virtue of the
logarithmic derivative
In mathematics, specifically in calculus and complex analysis, the logarithmic derivative of a function ''f'' is defined by the formula
\frac
where f' is the derivative of ''f''. Intuitively, this is the infinitesimal relative change in ''f ...
of
Riemann's functional equation, taken after applying
Euler's reflection formula
In mathematics, a reflection formula or reflection relation for a function ''f'' is a relationship between ''f''(''a'' − ''x'') and ''f''(''x''). It is a special case of a functional equation, and it is very common in the literature ...
,
[or see formula (14) in https://mathworld.wolfram.com/RiemannZetaFunction.html] these expressions in terms of the
can be written in terms of
, e.g.
:
6. For