The Lah Numbers with Higher Level and the Lah Numbers of Order s
Aleks Žigon Tankosič
TL;DR
This work develops two parallel generalizations of Lah numbers: a combinatorial higher-level variant and an algebraic order-$s$ variant, and then unifies them within a broader $(s,r)$-Lah framework. It defines the Lah numbers with higher level and derives a recurrence for the associated polynomials $Q_n^{s}(x)$, along with explicit sums and special cases, highlighting their combinatorial origin and connection to $(s,1)$-Lah numbers. It then introduces the Lah numbers of order $s$, gives their recurrence, derives relations with rising and falling factorials of higher level, and defines the Lah polynomials of order $s$ with a row-generating interpretation. Finally, it establishes inequalities and structural relations between the two generalizations and the classical Lah numbers, showing how they interlock and reduce to the ordinary case when $s=1$; these results broaden the combinatorial and algebraic toolkit for partition-based Lah-type numbers.
Abstract
In this paper we introduce and study two generalizations of Lah numbers, analogous to the Stirling numbers with higher level - a combinatorial one (Lah numbers with higher level) and an algebraic one (Lah numbers of order $s$). We define the Lah numbers with higher level following a combinatorial approach and the Lah numbers of order $s$ following an algebraic approach. We prove a direct connection between the Lah numbers with higher level and the $(l,r)$-Lah numbers. Some properties of the Lah numbers of order $s$ and Lah polynomials of order $s$ are given. Finally, we prove connections between these two generalizations.
