Stirling polynomials

In mathematics, the Stirling polynomials are a family of polynomials that generalize important sequences of numbers appearing in combinatorics and analysis, which are closely related to the Stirling numbers, the Bernoulli numbers, and the generalized Bernoulli polynomials. There are multiple variants of the Stirling polynomial sequence considered below most notably including the Sheffer sequence form of the sequence, [math]\displaystyle{ S_k(x) }[/math], defined characteristically through the special form of its exponential generating function, and the Stirling (convolution) polynomials, [math]\displaystyle{ \sigma_n(x) }[/math], which also satisfy a characteristic ordinary generating function and that are of use in generalizing the Stirling numbers (of both kinds) to arbitrary complex-valued inputs. We consider the "convolution polynomial" variant of this sequence and its properties second in the last subsection of the article. Still other variants of the Stirling polynomials are studied in the supplementary links to the articles given in the references.

Definition and examples

For nonnegative integers k, the Stirling polynomials, S_k(x), are a Sheffer sequence for [math]\displaystyle{ (g(t), \bar{f}(t)) := \left(e^{-t}, \log\left(\frac{t}{1-e^{-t}}\right)\right) }[/math] ^[1] defined by the exponential generating function

[math]\displaystyle{ \left( {t \over {1-e^{-t}}} \right) ^{x+1}= \sum_{k=0}^\infty S_k(x){t^k \over k!}. }[/math]

The Stirling polynomials are a special case of the Nørlund polynomials (or generalized Bernoulli polynomials) ^[2] each with exponential generating function

[math]\displaystyle{ \left( {t \over {e^t-1}} \right) ^a e^{z t}= \sum_{k=0}^\infty B^{(a)}_k(z){t^k \over k!}, }[/math]

given by the relation [math]\displaystyle{ S_k(x)= B_k^{(x+1)}(x+1) }[/math].

The first 10 Stirling polynomials are given in the following table:

k	Sk(x)
0	[math]\displaystyle{ 1 }[/math]
1	[math]\displaystyle{ {\scriptstyle\frac{1}{2}}(x+1) }[/math]
2	[math]\displaystyle{ {\scriptstyle\frac{1}{12}} (3x^2+5x+2) }[/math]
3	[math]\displaystyle{ {\scriptstyle\frac{1}{8}} (x^3+2x^2+x) }[/math]
4	[math]\displaystyle{ {\scriptstyle\frac{1}{240}} (15x^4+30x^3+5x^2-18x-8) }[/math]
5	[math]\displaystyle{ {\scriptstyle\frac{1}{96}} (3x^5+5x^4-5x^3-13x^2-6x) }[/math]
6	[math]\displaystyle{ {\scriptstyle\frac{1}{4032}} (63x^6+63x^5-315x^4-539x^3-84x^2+236x+96) }[/math]
7	[math]\displaystyle{ {\scriptstyle\frac{1}{1152}} (9x^7-84x^5-98x^4+91x^3+194x^2+80x) }[/math]
8	[math]\displaystyle{ {\scriptstyle\frac{1}{34560}} (135x^8-180x^7-1890x^6-840x^5+6055x^4+8140x^3+884x^2-3088x-1152) }[/math]
9	[math]\displaystyle{ {\scriptstyle\frac{1}{7680}} (15x^9-45x^8-270x^7+182x^6+1687x^5+1395x^4-1576x^3-2684x^2-1008x) }[/math]

Yet another variant of the Stirling polynomials is considered in ^[3] (see also the subsection on Stirling convolution polynomials below). In particular, the article by I. Gessel and R. P. Stanley defines the modified Stirling polynomial sequences, [math]\displaystyle{ f_k(n) := S(n+k, n) }[/math] and [math]\displaystyle{ g_k(n) := c(n, n-k) }[/math] where [math]\displaystyle{ c(n, k) := (-1)^{n-k} s(n, k) }[/math] are the unsigned Stirling numbers of the first kind, in terms of the two Stirling number triangles for non-negative integers [math]\displaystyle{ n \geq 1,\ k \geq 0 }[/math]. For fixed [math]\displaystyle{ k \geq 0 }[/math], both [math]\displaystyle{ f_k(n) }[/math] and [math]\displaystyle{ g_k(n) }[/math] are polynomials of the input [math]\displaystyle{ n \in \mathbb{Z}^{+} }[/math] each of degree [math]\displaystyle{ 2k }[/math] and with leading coefficient given by the double factorial term [math]\displaystyle{ (1 \cdot 3 \cdot 5 \cdots (2k-1)) / (2k)! }[/math].

Properties

Below [math]\displaystyle{ B_k(x) }[/math] denote the Bernoulli polynomials and [math]\displaystyle{ B_k = B_k(0) }[/math] the Bernoulli numbers under the convention [math]\displaystyle{ B_1 = B_1(0) = -\tfrac{1}{2}; }[/math] [math]\displaystyle{ s_{m,n} }[/math] denotes a Stirling number of the first kind; and [math]\displaystyle{ S_{m,n} }[/math] denotes Stirling numbers of the second kind.

• Special values: [math]\displaystyle{ \begin{align} S_k(-m) &= \frac{(-1)^k}{{k+m-1 \choose k}} S_{k+m-1,m-1} && 0 \lt m \in \Z\\[6pt] S_k(-1) &= \delta_{k,0} \\[6pt] S_k(0) &= (-1)^k B_k \\[6pt] S_k(1) &= (-1)^{k+1} ((k-1) B_k+ k B_{k-1}) \\[6pt] S_k(2) &= \tfrac{(-1)^k}{2} ((k-1)(k-2) B_k+ 3 k(k-2) B_{k-1}+ 2 k(k-1) B_{k-2}) \\[6pt] S_k(k) &= k! \\[6pt] \end{align} }[/math]
• If [math]\displaystyle{ m \in \N }[/math] and [math]\displaystyle{ m \lt k }[/math] then: [math]\displaystyle{ S_k(m) = {(m+1)}\binom k{m+1} \sum_{j=0}^m(-1)^{m-j} s_{m+1, m+1-j} \frac{B_{k-j}}{k-j}. }[/math]
• If [math]\displaystyle{ m \in \N }[/math] and [math]\displaystyle{ m \geq k }[/math] then:^[4] [math]\displaystyle{ S_k(m) = (-1)^k B_k^{(m+1)}(0), }[/math] and: [math]\displaystyle{ S_k(m)= {(-1)^k \over {m \choose k}} s_{m+1, m+1-k}. }[/math]

• The sequence [math]\displaystyle{ S_k(x-1) }[/math] is of binomial type, since [math]\displaystyle{ S_k(x+y-1)= \sum_{i=0}^k {k \choose i} S_i(x-1) S_{k-i}(y-1). }[/math] Moreover, this basic recursion holds: [math]\displaystyle{ S_k(x)= (x-k) {S_k(x-1) \over x} + k S_{k-1}(x+1). }[/math]
• Explicit representations involving Stirling numbers can be deduced with Lagrange's interpolation formula: [math]\displaystyle{ \begin{align} S_k(x)&= \sum_{n=0}^k (-1)^{k-n} S_{k+n,n} {{x+n \choose n} {x+k+1 \choose k-n} \over {k+n \choose n}} \\[6pt] &= \sum_{n=0}^k (-1)^n s_{k+n+1,n+1} {{x-k \choose n} {x-k-n-1 \choose k-n} \over {k+n \choose k}}\\[6pt] &= k! \sum_{j=0}^k (-1)^{k-j}\sum_{m=j}^k {x+m\choose m}{m\choose j}L_{k+m}^{(-k-j)}(-j) \\[6pt] \end{align} }[/math] Here, [math]\displaystyle{ L_n^{(\alpha)} }[/math] are Laguerre polynomials.
• The following relations hold as well: [math]\displaystyle{ {k+m \choose k} S_k(x-m)= \sum_{i=0}^k (-1)^{k-i} {k+m \choose i} S_{k-i+m,m} \cdot S_i(x), }[/math] [math]\displaystyle{ {k-m \choose k} S_k(x+m)= \sum_{i=0}^k {k-m \choose i} s_{m,m-k+i} \cdot S_i(x). }[/math]
• By differentiating the generating function it readily follows that [math]\displaystyle{ S_k^\prime(x) = -\sum_{j=0}^{k-1} {k \choose j} S_j(x) \frac{B_{k-j}}{k-j}. }[/math]

Stirling convolution polynomials

Definition and examples

Another variant of the Stirling polynomial sequence corresponds to a special case of the convolution polynomials studied by Knuth's article ^[5] and in the Concrete Mathematics reference. We first define these polynomials through the Stirling numbers of the first kind as

[math]\displaystyle{ \sigma_n(x) = \left[\begin{matrix} x \\ x-n \end{matrix} \right] \cdot \frac{1}{x(x-1)\cdots(x-n)}. }[/math]

It follows that these polynomials satisfy the next recurrence relation given by

[math]\displaystyle{ (x+1) \sigma_n(x+1) = (x-n) \sigma_n(x) + x \sigma_{n-1}(x),\ n \geq 1. }[/math]

These Stirling "convolution" polynomials may be used to define the Stirling numbers, [math]\displaystyle{ \scriptstyle{\left[\begin{matrix} x \\ x-n \end{matrix} \right]} }[/math] and [math]\displaystyle{ \scriptstyle{\left\{\begin{matrix} x \\ x-n \end{matrix} \right\}} }[/math], for integers [math]\displaystyle{ n \geq 0 }[/math] and arbitrary complex values of [math]\displaystyle{ x }[/math]. The next table provides several special cases of these Stirling polynomials for the first few [math]\displaystyle{ n \geq 0 }[/math].

n	σn(x)
0	[math]\displaystyle{ \frac{1}{x} }[/math]
1	[math]\displaystyle{ \frac{1}{2} }[/math]
2	[math]\displaystyle{ \frac1{24} (3 x - 1) }[/math]
3	[math]\displaystyle{ \frac1{48} (x^2 - x) }[/math]
4	[math]\displaystyle{ \frac1{5760} (15 x^3 - 30 x^2 + 5 x + 2) }[/math]
5	[math]\displaystyle{ \frac1{11520} (3 x^4 - 10 x^3 + 5 x^2 + 2 x) }[/math]
6	[math]\displaystyle{ \frac1{2903040} (63 x^5 - 315 x^4 + 315 x^3 + 91 x^2 - 42 x - 16) }[/math]
7	[math]\displaystyle{ \frac1{5806080} (9 x^6 - 63 x^5 + 105 x^4 + 7 x^3 - 42 x^2 - 16 x) }[/math]
8	[math]\displaystyle{ \frac1{1393459200} (135 x^7 - 1260 x^6 + 3150 x^5 - 840 x^4 - 2345 x^3 - 540 x^2 + 404 x + 144) }[/math]
9	[math]\displaystyle{ \frac1{2786918400} (15 x^8 - 180 x^7 + 630 x^6 - 448 x^5 - 665 x^4 + 100 x^3 + 404 x^2 + 144 x) }[/math]
10	[math]\displaystyle{ \frac1{367873228800} (99 x^9 - 1485 x^8 + 6930 x^7 - 8778 x^6 - 8085 x^5 + 8195 x^4 + 11792 x^3 + 2068 x^2 - 2288 x - 768) }[/math]

Generating functions

This variant of the Stirling polynomial sequence has particularly nice ordinary generating functions of the following forms:

[math]\displaystyle{ \begin{align} \left(\frac{z e^z}{e^z-1}\right)^x & = \sum_{n \geq 0} x \sigma_n(x) z^n \\ \left(\frac{1}{z} \ln \frac{1}{1-z}\right)^x & = \sum_{n \geq 0} x \sigma_n(x+n) z^n. \end{align} }[/math]

More generally, if [math]\displaystyle{ \mathcal{S}_t(z) }[/math] is a power series that satisfies [math]\displaystyle{ \ln\left(1-z \mathcal{S}_t(z)^{t-1}\right) = -z \mathcal{S}_t(z)^t }[/math], we have that

[math]\displaystyle{ \mathcal{S}_t(z)^x = \sum_{n \geq 0} x \sigma_n(x+tn) z^n. }[/math]

We also have the related series identity ^[6]

[math]\displaystyle{ \sum_{n \geq 0} (-1)^{n-1} \sigma_n(n-1) z^n = \frac{z}{\ln(1+z)} = 1 +\frac{z}{2} - \frac{z^2}{12} + \cdots, }[/math]

and the Stirling (Sheffer) polynomial related generating functions given by

[math]\displaystyle{ \sum_{n \geq 0} (-1)^{n+1} m \cdot \sigma_n(n-m) z^n = \left(\frac{z}{\ln(1+z)}\right)^m }[/math]

[math]\displaystyle{ \sum_{n \geq 0} (-1)^{n+1} m \cdot \sigma_n(m) z^n = \left(\frac{z}{1-e^{-z}}\right)^m. }[/math]

Properties and relations

For integers [math]\displaystyle{ 0 \leq k \leq n }[/math] and [math]\displaystyle{ r, s \in \mathbb{C} }[/math], these polynomials satisfy the two Stirling convolution formulas given by

[math]\displaystyle{ (r+s) \sigma_n(r+s+tn) = rs \sum_{k=0}^n \sigma_k(r+tk) \sigma_{n-k}(s+t(n-k)) }[/math]

and

[math]\displaystyle{ n \sigma_n(r+s+tn) = s \sum_{k=0}^n k \sigma_k(r+tk) \sigma_{n-k}(s+t(n-k)). }[/math]

When [math]\displaystyle{ n, m \in \mathbb{N} }[/math], we also have that the polynomials, [math]\displaystyle{ \sigma_n(m) }[/math], are defined through their relations to the Stirling numbers

[math]\displaystyle{ \begin{align} \left\{\begin{matrix} n \\ m \end{matrix} \right\} & = (-1)^{n-m+1} \frac{n!}{(m-1)!} \sigma_{n-m}(-m)\ (\text{when } m \lt 0) \\ \left[\begin{matrix} n \\ m \end{matrix} \right] & = \frac{n!}{(m-1)!} \sigma_{n-m}(n)\ (\text{when } m \gt n), \end{align} }[/math]

and their relations to the Bernoulli numbers given by

[math]\displaystyle{ \begin{align} \sigma_n(m) & = \frac{(-1)^{m+n-1}}{m! (n-m)!} \sum_{0 \leq k \lt m} \left[\begin{matrix} m \\ m-k \end{matrix} \right] \frac{B_{n-k}}{n-k},\ n \geq m \gt 0 \\ \sigma_n(m) & = -\frac{B_n}{n \cdot n!},\ m = 0. \end{align} }[/math]

See also

• Bernoulli polynomials
• Bernoulli polynomials of the second kind
• Sheffer and Appell sequences
• Difference polynomials
• Special polynomial generating functions
• Gregory coefficients

References

• Erdeli, A.; Magnus, W.; Oberhettinger, F.; Tricomi, F. G.. Higher Transcendental Functions. Volume III. New York. 
• Graham; Knuth; Patashnik (1994). Concrete Mathematics: A Foundation for Computer Science. 
• S. Roman (1984). The Umbral Calculus. 

External links

• Weisstein, Eric W.. "Stirling Polynomial". http://mathworld.wolfram.com/StirlingPolynomial.html. 
• Weisstein, Eric W.. "Nørlund Polynomial". http://mathworld.wolfram.com/NorlundPolynomial.html. 

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Stirling polynomials. Read more