Math 4 Wisdom. "Mathematics for Wisdom" by Andrius Kulikauskas. | Exposition / DerivationOfTheClassificationOfShefferPolynomials

Derivation of the Classification of Sheffer Polynomials

{$A(s)e^{xu(s)}=\sum_{n=0}^{\infty}\frac{P_n(x)}{n!}s^n$}

{$t(D)=D+t_2D^2+t_3D^3+\cdots$}

{$t(D)P_n(x)=nP_{n-1}(x)$}

{$A(s)=\sum_{n=0}^{\infty}\frac{P_n(0)}{n!}s^n$}

Recurrence relation

{$P_{n+1}(x)=(x+l_{n+1})P_n(x) +k_{n+1}P_{n-1}(x)$}

See Tom Koornwinder's note.

{$l_{n+1}=l_1+nl$}, {$k_{n+1}=n(k_2+(n-1)k)$}, {$(l\in\mathbb{R},k_2<0,k\leq 0)$}

{$t'(u)=1-lt(u)-kt(u)^2$}

{$P_{n+1}=(x+nl)P_n(x)+n(k_2+(n-1)k)P_{n-1}(x)$}

Differential equation

How to algebraically derive a differential equation that works for the case when {$f\neq 0$}?
How to combinatorially derive an interpretation that satisfies the case when {$f\neq 0$}?
Contact Dongsu Kim and Jiang Zeng regarding this.

{$$A(s)=\sum_{n=1}^{\infty}\frac{P_n(0)}{n!}s^n$$}	Given formula for {$A(s)$}
{$$A'(s)=\sum_{n=1}^{\infty}\frac{P_n(0)}{(n-1)!}s^{n-1}$$}	Derive formula for {$A'(s)$}
{$$A'(s) = \sum_{m=0}^{\infty}\frac{P_{m+1}(0)}{m!}s^m$$}	Set {$m=n-1$}
{$$P_{n+1}(0)=nlP_n(0)+n(k_2+(n-1)k)P_{n-1}(0)$$}	Given recurrence relation for orthogonal Sheffer polynomials
{$$\frac{1}{n!}P_{n+1}(0)=\frac{l}{(n-1)!}P_n(0) + \frac{k_2}{(n-1)!}P_{n-1}(0) + \frac{k}{(n-2)!}P_{n-1}(0)$$}	divide by {$n!$}
{$$\frac{1}{n!}P_{n+1}(0)=\frac{l}{(n-1)!}P_n(0)s^{n-1} + \frac{k_2}{(n-1)!}P_{n-1}(0)s^{n-1} + \frac{k}{(n-2)!}P_{n-1}(0)s^{n-1}$$}	multiply by {$s^{n-1}$}
{$$\sum_{n=2}^{\infty}\frac{P_{n+1}(0)}{n!}s^{n-1} = l\sum_{n=2}^{\infty}\frac{P_n(0)}{(n-1)!}s^{n-1} + k_2\sum_{n=2}^{\infty}\frac{P_{n-1}(0)}{(n-1)!}s^{n-1} + k\sum_{n=2}^{\infty}\frac{P_{n-1}(0)}{(n-2)!}s^{n-1}$$}	sum from n=2 to {$\infty$}
{$$\frac{1}{s}\sum_{n=2}^{\infty}\frac{P_{n+1}(0)}{n!}s^{n} = l\sum_{n=2}^{\infty}\frac{P_n(0)}{(n-1)!}s^{n-1} + k_2\sum_{n=2}^{\infty}\frac{P_{n-1}(0)}{(n-1)!}s^{n-1} + k\sum_{n=2}^{\infty}\frac{P_{n-1}(0)}{(n-2)!}s^{n-1}$$}	in the first sum, pull out {$\frac{1}{s}$}
{$$\frac{1}{s}[A'(s)-P_2(0)s - P_1(0)] = l[A'(s) - P_1(0)] + k_2[A(s) - P_0(0)] + k[sA'(s)]$$}	reexpress sums (minus initial terms for n=1, n=0) as functions (minus these initial terms)
{$$A'(s)[\frac{1}{s}-l - ks] + [- P_2(0) - \frac{P_1(0)}{s} + lP_1(0) + k_2P_0(0)] = k_2A(s)$$}	collect terms
{$$A'(s)[\frac{1}{s}-l - ks] + [- P_2(0) - \frac{P_1(0)}{s} + lP_1(0) + k_2] = k_2A(s)$$}	by convention {$P_0(x)=1$}
{$$A'(s)[\frac{1}{s}-l - ks] + [- l_1P_1(0) - \frac{P_1(0)}{s}] = k_2A(s)$$}	{$P_2(0)= -l_2P_1(0) + k_2P_0(0)$} and {$l_2=l_1+l$} so {$-P_2(0) + lP_1(0) + k_2=-l_1P_1(0)$}
{$$A'(s)[\frac{1}{s}-l - ks] = k_2A(s)$$}	by convention {$l_1=0$} which means {$P_1(x)=x$} so {$P_1(0)=0$}
{$$\frac{A'(s)}{s}[1-ls - ks^2] = k_2A(s)$$}	factor out {$\frac{1}{s}$}
{$$\frac{A'(s)}{sA(s)}=\frac{k_2}{1-ls - ks^2}$$}	divide on either side

Explicit formula for {$t(D)$}

{$$t(D)=\frac{e^{(\alpha-\beta)D}-1}{e^{(\alpha-\beta)D}-\beta}$$}

When {$\beta\rightarrow\alpha$} we have {$t(D)=\frac{D}{1+\alpha D}$}.

In the general case we have {$(e^{(\alpha - \beta)D}-1)g(x)=g(x+\alpha - \beta)-g(x)$}.

Moments and Distributions

From moments to distribution

Thanks to John Harland!

{$\hat{\omega}(\xi)=\sum_{n=0}^{\infty}\frac{(-2\pi i)^n\mu_n}{n!}\xi^n$}

{$\omega(x)=(\check{\hat{\omega}})(x)=\int\hat{\omega}(\xi)e^{2\pi i x\xi}\textrm{d}\xi$}

Orthogonality measure

{$$\int_{-\infty}^{\infty}e^{xu}\textrm{d}\psi(x)=\frac{1}{A(t(u))}\int_{-\infty}^{\infty}\textrm{d}\psi(x)$$}

polynomials	moments	objects counted	generating function {$g(t)$}	weight function {$w(x)$}	{$u(t)$}
Meixner	{$L(x^n)=a(n)$}	ordered Bell numbers (weak orderings of a set)	{$\sum_{n=0}^{\infty}a(n)\frac{t^n}{n!} = \frac{1}{1-(e^t-1)}$}	step function {$\frac{a^k(\beta)_k}{k!}$} on interval {$[k,k+1)$}	{$\frac{1}{\beta - \alpha}\textrm{ln}(1-\alpha t)+\frac{1}{\alpha - \beta}\textrm{ln}(1-\beta t)$}
Charlier	{$L(x^n)=B_n$}	Bell numbers (partitions of a set)	{$\sum_{n=0}^{\infty}B_n\frac{t^n}{n!} = e^{e^t-1}$}	step function {$\frac{a^k}{k!}$} on interval {$[k,k+1)$}	{$-\frac{1}{\alpha}\textrm{ln}(1-\alpha t)$}
Laguerre	{$L(x^n)=n!$}	permutations	{$\sum_{n=0}^{\infty}n!\frac{t^n}{n!} = \frac{1}{1-t}$}	{$x^\alpha e^{-x}$}	{$\frac{t}{(1 - \alpha t)}$}
Hermite	{$L(x^n)=j(n)$}	involutions without fixed points	{$\sum_{n=0}^{\infty}j(n)\frac{t^n}{n!} = e^{\frac{t^2}{2}}$}	{$e^{-x^2}$}	{$t$}
Meixner-Pollaczek	{$L(x^n)=A_n$}	zigzag permutations	{$\sum_{n=0}^{\infty}A_n\frac{t^n}{n!} = \textrm{sec}\;t$}	{$\frac{\|\Gamma(\frac{n+ix}{2})\|^2}{\|\Gamma(\frac{n}{2})\|^2}e^{-x\;\textrm{tan}^{-1}\delta} $}	{$\frac{1}{\overline{\alpha} - \alpha}\textrm{ln}(1-\alpha t)+\frac{1}{\alpha - \overline{\alpha}}\textrm{ln}(1-\overline{\alpha} t)$}

Note the progression. In terms of the generating functions, we start by assembling collections of nontrivial terms from the exponential, yielding partitioned orderings. We then switch to the exponential function, yielding partitions of unordered sets. We then collapse further so that n! in the numerator and denominator cancel out, yielding permutations. We then lose the odd terms and have building blocks that give only even terms, transpositions. We then seem to link together transpositions into zigzag permutations, and they manifest steps in a circular order.

Think of {$N=\frac{-\gamma}{\alpha\beta}$} as a positive integer. Then the Meixner polynomials are the same as the Kravchuk polynomials.

The weight function for the Meixner polynomials is {$w((\alpha-\beta)n)=(\frac{\alpha}{\beta})^n\binom{N}{n}$}.

If {$\alpha - \beta \neq 0$} then the entire system is moving with a mean {$pN$} and a variance {$p(p-1)N$}.

For Meixner-Pollaczek polynomials the unit of space-time is {$\alpha - \bar{\alpha}=2bi$}. The weight function is {$w((2bi)n)=w(\frac{\alpha}{\bar{\alpha}}|\alpha|n) = (\textrm {cos}\;2n\theta + i\; \textrm{sin}\;2n\theta)\binom{N}{n}$}. This is in terms of {$\theta$} where {$\frac{\alpha}{\bar{\alpha}}=\textrm{cos}2\theta + i\textrm{sin}2\theta$}.

References

Math Stack Exchange. Generating function for fixed-point free involutions.