Lah Numbers

In mathematics, the (signed and unsigned) Lah numbers are coefficients expressing rising factorials in terms of falling factorials and vice versa. They were discovered by Ivo Lah in 1954. Explicitly, the unsigned Lah numbers $L(n, k)$ are given by the formula involving the binomial coefficient

$L(n,k) = \frac$

for $n \geq k \geq 1$.

Unsigned Lah numbers have an interesting meaning in combinatorics: they count the number of ways a set of ''$n$'' elements can be partitioned into ''$k$'' nonempty linearly ordered subsets. Lah numbers are related to Stirling numbers.

For $n \geq 1$, the Lah number $L(n, 1)$ is equal to the factorial $n!$ in the interpretation above, the only partition of $\$ into 1 set can have its set ordered in 6 ways:$\, \, \, \, \, \$$L(3, 2)$ is equal to 6, because there are six partitions of $\$ into two ordered parts:$\, \, \, \, \, \$$L(n, n)$ is always 1 because the only way to partition $\$ into $n$ non-empty subsets results in subsets of size 1, that can only be permuted in one way.
In the more recent literature, Karamata– Knuth style notation has taken over. Lah numbers are now often written as$L(n,k) = \left\lfloor \right\rfloor$

Table of values

Below is a table of values for the Lah numbers:

The row sums are $1, 1, 3, 13, 73, 501, 4051, 37633, \dots$ .

Rising and falling factorials

Let $x^$ represent the rising factorial $x(x+1)(x+2) \cdots (x+n-1)$ and let $(x)_n$ represent the falling factorial $x(x-1)(x-2) \cdots (x-n+1)$. The Lah numbers are the coefficients that express each of these families of polynomials in terms of the other. Explicitly,$x^ = \sum_^n L(n,k) (x)_k$and$(x)_n = \sum_^n (-1)^ L(n,k)x^.$For example,$x(x+1)(x+2) = x + x(x-1) + x(x-1)(x-2)$and$x(x-1)(x-2) = x - x(x+1) + x(x+1)(x+2),$

where the coefficients 6, 6, and 1 are exactly the Lah numbers $L(3, 1)$, $L(3, 2)$, and $L(3, 3)$.

Identities and relations

The Lah numbers satisfy a variety of identities and relations.

In Karamata– Knuth notation for Stirling numbers$L(n,k) = \sum_^n \left$right\left\where $\left$right/math> are the unsigned Stirling numbers of the first kind and $\left\$ are the Stirling numbers of the second kind.
:$L(n,k) = \frac = \frac = (n-k)!$

:$L(n,k) = \frac\cdot\frac = \left (\frac \right )^2\frac$

:$k(k+1) L(n,k+1) = (n-k) L(n,k)$, for $k>0$.

Recurrence relations

The Lah numbers satisfy the recurrence relations$\begin L(n+1,k) &= (n+k) L(n,k) + L(n,k-1) \\ &= k(k+1) L(n, k+1) + 2k L(n, k) + L(n, k-1) \end$where $L(n,0)=\delta_n$, the Kronecker delta, and $L(n,k)=0$ for all $k > n$.

Exponential generating function

:$\sum_ L(n,k)\frac = \frac\left( \frac \right)^k$

Derivative of exp(1/''x'')

The ''n''-th derivative of the function $e^\frac1$ can be expressed with the Lah numbers, as follows$\frac e^\frac1x = (-1)^n \sum_^n \frac \cdot e^\frac1x.$For example,

$\frac e^\frac1x = - \frac \cdot e^$

$\frace^\frac1 = \frac \left(-\frac1 e^ \right)= -\frac \cdot e^ - \frac1 \cdot \frac \cdot e^= \left(\frac2 + \frac1\right) \cdot e^$

$\frac e^\frac1 = \frac \left( \left(\frac2 + \frac1\right) \cdot e^ \right) = \left(\frac + \frac\right) \cdot e^ + \left(\frac2 + \frac1\right) \cdot \frac \cdot e^ =-\left(\frac6 + \frac6 + \frac1\right) \cdot e^$

Link to Laguerre polynomials

Generalized Laguerre polynomials $L^_n(x)$ are linked to Lah numbers upon setting $\alpha = -1$$n! L_n^(x) =\sum_^n L(n,k) (-x)^k$This formula is the default Laguerre polynomial in Umbral calculus convention.

Practical application

In recent years, Lah numbers have been used in steganography for hiding data in images. Compared to alternatives such as DCT, DFT and DWT, it has lower complexity of calculation—$O(n \log n)$—of their integer coefficients.
The Lah and Laguerre transforms naturally arise in the perturbative description of the chromatic dispersion.
In Lah-Laguerre optics, such an approach tremendously speeds up optimization problems.

See also

* Stirling numbers
* Pascal matrix

References

External links

* The signed and unsigned Lah numbers are respectively and

{{DEFAULTSORT:Lah Number
Factorial and binomial topics
Integer sequences
Triangles of numbers