Extensions of the $Stirling$ numbers of the second kind and $Dobinski$ -like formulas are proposed in a series of exercises for graduates. Some of these new formulas recently discovered by me are to be found in the source paper $ [1]$. These extensions naturally encompass the well known $q$- extensions. The indicatory references are to point at a part of the vast domain of the foundations of computer science in arxiv affiliation.
Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further consecutive umbral extensions q-stirling numbers are therefore realized here in a two-fold way. The fact that the umbral q-extended dobinski formula may also be interpreted as the average of powers of random variable with the q-poisson distribution singles out the q-extensions which appear to be a kind of singular point in the domain of umbral extensions as…
We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski relations. These new combinatorial numbers are shown to be coherent state matrix elements of powers of the monomials in question. It is further demonstrated that such Bell-type numbers, when considered as power moments, give rise to positive measures on the positive half-axis, which in many cases can be written in terms of known functions.
Conventional Bell and Stirling numbers arise naturally in the normal ordering of simple monomials in boson operators. By extending this process we obtain generalizations of these combinatorial numbers, defined as coherent state matrix elements of arbitrary monomials, as well as the associated Dobinski relations. These Bell-type numbers may be considered as power moments and give rise to positive measures which allow the explicit construction of new classes of coherent states.
Cigler simple derivation of usual and extended Dobinski formula is recalled and it is noted that both may be interpreted as averages of powers of random variables with the corresponding usual or extended Poisson distributions. In parallel more general formulas of extended operator umbral calculi origin are revealed . The formulas encompass both earlier cases as very specific ones.
At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of uncountable family of extended difference calculus nonhomogeneous equations extends to Ward-Appell polynomials case . Illustrative specifications to q-calculus case and fibonomial calculus case are made explicit due to the usage of the so called upside down notation for objects of extended finite operator calculus .
We consider properties of the operators D(r,M)=a^r(a^†a)^M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a^†are boson annihilation and creation operators respectively, satisfying [a,a^†]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation which generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combina…
We consider sequences of generalized Bell numbers B(n), n=0,1,... for which there exist Dobinski-type summation formulas; that is, where B(n) is represented as an infinite sum over k of terms P(k)^n/D(k). These include the standard Bell numbers and their generalizations appearing in the normal ordering of powers of boson monomials, as well as variants of the "ordered" Bell numbers. For any such B we demonstrate that every positive integral power of B(m(n)), where m(n) is a quadratic function of n with positive integral coefficients, is the n-th moment of a positive function on the positive rea…
We describe proofs of the standard generating formulas for unsigned and signed Stirling numbers of the first kind that follow from a natural combinatorial interpretation based on cycle-colored permutations.
Stirling's formula, the asymptotic expansion of $n!$ for $n$ large, or of $Γ(z)$ for $z\to \infty$, is derived directly from the recursion equation $Γ(z+1) =z Γ(s)$ and the normalization condition $Γ({1/2}) =\sqrtπ$.
In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both kind is given. Namely, Stirling numbers of the first kind appear in the closed formula for the n-th derivative of ln x. In the same way Stirling numbers of the second kind appear in the formula for the n-th derivative of f(e^x), where f(x) is an arbitrary smooth real function. This facts allow us to define Stirling numbers within the frame of differential calc…
We use the Jacobi-Trudi formula to execute "explicit" evaluation of determinants of Stirling numbers of both kinds. We also offer a Maple package accompanying the paper on the personal websites at the end of the second page.
In the paper, the authors review some explicit formulas and establish a new explicit formula for Bernoulli and Genocchi numbers in terms of Stirling numbers of the second kind.
Inversion formulas have been found, converting between Stirling, tanh and Lah numbers. Tanh and Lah polynomials, analogous to the Stirling polynomials, have been defined and their basic properties established. New identities for Stirling and tangent numbers and polynomials have been derived from the general inverse relations. In the second part of the paper, it has been shown that if shifted-gamma probability densities and negative binomial distributions are matched by equating their first three semi-invariants (cumulants), then the cumulants of the two distributions are related by a pair of r…
In the paper, the author finds an explicit formula for computing Bell numbers in terms of Kummer confluent hypergeometric functions and Stirling numbers of the second kind.
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the type A Coxeter arrangement and the symmetric group) these restricted Whitney numbers are Stirling numbers of the first kind. We use this observation to obtain a formula for the coefficients of the Kazhdan-Lusztig polynomials for braid matroids in terms of sums of products of Stirling numbers of the first kind. This results in new identities between Stirling …
Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type B. We find a formula for the number of minimally intersecting r-tuples of $B_n$-partitions, as well as a formula for the number of minimally intersecting r-tuples of $B_n$-partitions without zero-block. As a consequence, it follows the formula of Benoumhani for the Dowling number in analogy to Dobinski's formula.
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.
It is shown in this note that non-central Stirling numbers s(n,k,a) of the first kind naturally appear in the expansion of derivatives of the product of a power function and a logarithn function. We first obtain a recurrence relation for these numbers, and then, using Leibnitz rule we obtain an explicit formula for these numbers. We also obtain an explicit formula for s(n,1,a), and then derive several combinatorial identities related to these numbers.
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing Euler polynomials and two-parameter Euler polynomials, which are a newly introduced notion, in terms of Stirling numbers of the second kind.
In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.
In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind and Stirling numbers of the first kind. As consequences of these formulas, a recursion for Stirling numbers of the first kind and a new representation of the reciprocal of the factorial $n!$ are derived. Finally, the author finds several identities and integral representations relating to Stirling numbers of the first kind.
In the paper, the authors provide four alternative proofs of an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.
We present details of logically simplest integral sufficient for deducing the Stirling asymptotic formula for n!. It is the Newton integral, defined as the difference of values of any primitive at the endpoints of the integration interval. We review in its framework in detail two derivations of the Stirling formula. The first approximates log(1)+log(2)+...+log(n) with an integral and the second uses the classical gamma function and a Fubini-type result. We mention two more integral representations of n!.
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the asymptotic distribution, obtained from the Central Limit Theorem and a local limit variant.
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and explicit formulas are studied. Combinatorial explanations are given for some equidistributions.
For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling numbers of the second kind. Thereby a supplement of the asymptotic analysis for these numbers is established.
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial, restricted Bell, and $r$-derangement numbers (and probably more!). By combining methods from analytic combinatorics, umbral calculus, and probability theory, we derive several recurrence relations and closed form expressions for these numbers. By specializing our results to the classical case, we recover explicit formulae for the Bell and Stirling numbers as sums …
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of binomial-Stirling type. These extended Stirling numbers determine (via matrix inversion) dual systems, which are also shown to have combinatorial realizations within the wreath product. The above setting also gives rise to MacMahon type equi-distribution theorem over subsets with prescribed statistics.
Marked mesh patterns are a very general type of permutation pattern. We examine a particular marked mesh pattern originally defined by Kitaev and Remmel, and show that its generating function is described by the $r$-Stirling numbers. We examine some ramifications of various properties of the $r$-Stirling numbers for this generating function, and find (seemingly new) formulas for the $r$-Stirling numbers in terms of the classical Stirling numbers and harmonic numbers. We also answer some questions posed by Kitaev and Remmel and show a connection to another mesh pattern introduced by Kitaev and …
A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also, as an application to algebraic topology, some isomorphisms of unstable $K^1$-groups of stunted complex projective spaces are deduced.
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.
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some recurrences and a connection to r-Stirling numbers. To obtain our results, we use pure combinatorial arguments, classical manipulations of generating functions and to derive the generating functions we apply the symbolic method.
For the Legendre-Stirling numbers of the second kind asymptotic formulae are derived in terms of a local central limit theorem. Thereby, supplements of the recently published asymptotic analysis of the Chebyshev-Stirling numbers are established. Moreover, we provide results on the asymptotic normality and unimodality for modified Legendre-Stirling numbers.
We use rook placements to prove Spivey's Bell number formula and other identities related to it, in particular, some convolution identities involving Stirling numbers and relations involving Bell numbers. To cover as many special cases as possible, we work on the generalized Stirling numbers that arise from the rook model of Goldman and Haglund. An alternative combinatorial interpretation for the Type II generalized $q$-Stirling numbers of Remmel and Wachs is also introduced in which the method used to obtain the earlier identities can be adapted easily.
We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.
We provide q-generalizations of Spivey's Bell number formula in various settings by considering statistics on different combinatorial structures. This leads to new identities involving q-Stirling numbers of both kinds and q-Lah numbers. As corollaries, we obtain identities for both binomial and q-binomial coefficients. Our results at the same time also generalize recent r-Stirling number formulas of Mezo. Finally, we provide a combinatorial proof and refinement of Xu's extension of Spivey's formula to the generalized Stirling numbers of Hsu and Shiue. To do so, we develop a combinatorial inter…
Several series expansions for real powers and several formulas for partial Bell polynomials of sinc and sinhc functions in terms of central factorial and Stirling numbers of second kind
本文利用 Faà di Bruno 公式、第二类中心阶乘数和第二类 Stirling 数，建立了 sinc 与 sinhc 函数实数幂的级数展开式，并给出相关偏 Bell 多项式闭式公式及组合数恒等式。
The normal ordering coefficients of strings consisting of $V,U$ which satisfy $UV=qVU+hV^s$ ($s\in\mathbb N$) are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized recurrence, and second, as $q$-analogues of rook numbers under the row creation rule introduced by Goldman and Haglund. A number of properties are derived, including recurrences, expressions involving other $q$-analogues and explicit formulas. We also give a Dobinsky-type formula for the associated Bell numbers and the corresponding extension of Spivey's Bell numb…
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the first kind. As by-products, the author also recovers three explicit formulas for special values of the Bell polynomials of the second kind.
