We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common features: combinatorial interpretations, Pascal-like recurrences, inverse relations with their signed versions, and interpretations as coefficients of change between polynomial bases.
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series transformation formulas.
The Stirling numbers of the second kind are related to normal orderings in the Weyl algebra, while the unsigned Stirling numbers of the first kind are related to normal orderings in the shift algebra. Kim-Kim introduced a λ-analogue of the unsigned Stirling numbers of the first kind and that of the r-Stirling numbers of the first kind. In this paper, we introduce a λ-analogue of the shift algebra (called λ-shift algebra) and investigate normal orderings in the λ-shift algebra. From the normal orderings in the λ-shift algebra, we derive some identities about the λ-analogue of the unsigned Stirl…
We construct a new parametrization of double sequences $\{A_{n,k}(s)\}_{n,k}$ between $A_{n,k}(0)= \binom{n-1}{k-1}$ and $A_{n,k}(1)= \frac{1}{n!}\stirl{n}{k}$, where $\stirl{n}{k}$ are the unsigned Stirling numbers of the first kind. For each $s$ we prove a central limit theorem and a local limit theorem. This extends the de\,Moivre--Laplace central limit theorem and Goncharov's result, that unsigned Stirling numbers of the first kind are asymptotically normal. Herewith, we provide several applications.
In this paper, we investigate certain combinatorial numbers, the \textit{moment generating Stirling numbers}. They are a special case of Hsu's generalized Stirling numbers and satisfy many more properties and combinatorial identities than are known in the general case. As application, we provide the computation of the moments and central moments of the phase type distribution, the recurrence time in Markov chains, the geometric distribution, the negative binomial distribution and of a class of distributions generalizing the negative binomial distribution. All computations can be performed in c…
This paper presents a number of identities for Dirichlet series and series with Stirling numbers of the first kind. As coefficients for the Dirichlet series we use Cauchy numbers of the first and second kinds, hyperharmonic numbers, derangement numbers, binomial coefficients, central binomial coefficients, and Catalan numbers.
We evaluate in closed form several series involving products of Cauchy numbers with other special numbers (harmonic, skew-harmonic, hyperharmonic, and central binomial). Similar results are obtained with series involving Stirling numbers of the first kind. We focus on several particular cases which give new closed forms for Euler sums of hyperharmonic numbers and products of hyperharmonic and harmonic numbers.
A triangular field of rational numbers is characterized, with relations to Stirling numbers 2nd, Hyperbolic functions, and centered Binomial distribution. A Generating function is given.
We define C sequential optimization numbers, where C is a k+1-tuple vector. We prove that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Many achievements of the Stirling numbers of first kind can be transformed into the properties of C sequential optimization numbers. We give some examples such as the recurrence formula and an instance of C sequential optimization numbers. We also extend some properties such as an upper bounder of them.
