Factorial functions and stirling numbers of fractional orders

The aim of this paper is to study the binomial coefficients ( _n ^x ), the factorial polynomials [x]_n and [x]ⁿ, the Stirling numbers of first and second kind, namely s(n,k) and S(n,k), in the case that n ∈ ? is replaced by real α ∈ ?. In the course of the paper, the Vandermonde convolution formula is presented in an infinite series frame, the binomial coefficient function ( _a ^x ), α ∈ ?, is sampled in terms of the binomial coefficients ( _k ^x ) for k ∈ ?_o, Bell numbers of fractional orders are introduced. Emphasis is placed on the fractional order Stirling numbers s(α,k) and S(α,k), first studied here. Some applications of the S(α,k) are given.     

Non-central stirling numbers and some applications

Non-central Stirling numbers of the first and second kind are introduced and corresponding representations and recurrences are given along with some applications in occupancy problems and discrete distribution theory.     

Sterling stirling play

In this paper we analyze a recently proposed impartial combinatorial ruleset that is played on a permutation of the set \(\left[ n\right] \). We call this ruleset Stirling Shave. A procedure utilizing the ordinal sum operation is given to determine the nim value of a given normal play position. Additionally, we enumerate the number of permutations of \(\left[ n\right] \) which are \(\mathcal {P}\)-positions. The formula given involves the Stirling numbers of the first-kind. We also give a complete analysis of the Misère version of Stirling Shave using Conway’s genus theory. An interesting by-product of this analysis is insight into how the ordinal sum operation behaves in Misère Play.     

Inequalities for the gamma function

Some inequalities for the gamma function are given. These results refine the classical Stirling approximation and its many recent improvements. Received: 2 May 2008, Revised: 2 September 2008     

A Unified Approach to Generalized Stirling Functions

Here presented is a unified approach to generalized Stirling functions by using generalized factorial functions, k-Gamma functions, generalized divided difference, and the unified expression of Stirling numbers defined in [16]. Previous well-known Stirling functions introduced by Butzer and Hauss [4], Butzer, Kilbas, and Trujilloet [6] and others are included as particular cases of our generalization. Some basic properties related to our general pattern such as their recursive relations, generating functions, and asymptotic properties are discussed,which extend the corresponding results about the Stirling numbers shown in [21] to the defined Stirling functions.     

Some inequalities for the Bell numbers

In this paper, we present derivatives of the generating functions for the Bell numbers by induction and by the Faà di Bruno formula, recover an explicit formula in terms of the Stirling numbers of the second kind, find the (logarithmically) absolute and complete monotonicity of the generating functions, and construct some inequalities for the Bell numbers. From these inequalities, we derive the logarithmic convexity of the sequence of the Bell numbers.     

Some properties and an application of multivariate exponential polynomials

In the paper, the authors introduce a notion “multivariate exponential polynomials” which generalize exponential numbers and polynomials, establish explicit formulas, inversion formulas, and recurrence relations for multivariate exponential polynomials in terms of the Stirling numbers of the first and second kinds with the help of the Faà di Bruno formula, two identities for the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds, construct some determinantal inequalities and product inequalities for multivariate exponential polynomials with the aid of some properties of completely monotonic functions and other known results, derive the logarithmic convexity and logarithmic concavity for multivariate exponential polynomials, and finally find an application of multivariate exponential polynomials to white noise distribution theory by confirming that multivariate exponential polynomials satisfy conditions for sequences required in white noise distribution theory.     

A probabilistically attained set of polynomials that generate stirling numbers of the second kind

Using probabilistic arguments, we derive a sequence of polynomials in one variable which generate the Stirling numbers of the second kind. Specifically, S^m_c=(c!/m!)P_c-m(c), where S^m_c is the desired Stirling number and P_c-m(·) is the polynomial of degree c-m.     

Periodicities of partition functions and stirling numbers modulo p

If p(n, k) is the number of partitions of n into parts ≤k, then the sequence {p(k, k), p(k + 1, k),…} is periodic modulo a prime p. We find the minimum period Q = Q(k, p) of this sequence. More generally, we find the minimum period, modulo p, of {p(n; T)}_{n ≥ 0}, the number of partitions of n whose parts all lie in a fixed finite set T of positive integers. We find the minimum period, modulo p, of {S(k, k), S(k + 1, k),…}, where these are the Stirling numbers of the second kind. Some related congruences are proved. The methods involve the use of cyclotomic polynomials over Z_p[x].     

On multivariate logarithmic polynomials and their properties

In the paper, the author introduces a new notion “multivariate logarithmic polynomial”, establishes two recurrence relations, an explicit formula, and an identity for multivariate logarithmic polynomials by virtue of the Faà di Bruno formula and two identities for the Bell polynomials of the second kind in terms of the Stirling numbers of the first and second kinds, and constructs some determinantal inequalities, some product inequalities, and logarithmic convexity for multivariate logarithmic polynomials by virtue of some properties of completely monotonic functions.     

k-途径正则有向图

In this paper, we define a class of strongly connected digraph, called the k-walk- regular digraph, study some properties of it, provide its some algebraic characterization and point out that the 0-walk-regular digraph is the same as the walk-regular digraph discussed by Liu and Lin in 2010 and the D-walk-regular digraph is identical with the weakly distance-regular digraph defined by Comellas et al in 2004.     

The Legendre–Stirling numbers

The Legendre–Stirling numbers are the coefficients in the integral Lagrangian symmetric powers of the classical Legendre second-order differential expression. In many ways, these numbers mimic the classical Stirling numbers of the second kind which play a similar role in the integral powers of the classical second-order Laguerre differential expression. In a recent paper, Andrews and Littlejohn gave a combinatorial interpretation of the Legendre–Stirling numbers. In this paper, we establish several properties of the Legendre–Stirling numbers; as with the Stirling numbers of the second kind, they have interesting generating functions and recurrence relations. Moreover, there are some surprising and intriguing results relating these numbers to some classical results in algebraic number theory.     

Total positivity properties of Jacobi–Stirling numbers

The Jacobi–Stirling numbers of the first and second kinds were first introduced in Everitt et al. (2007) [8] and they are a generalization of the Legendre–Stirling numbers. Quite remarkably, they share many similar properties with the classical Stirling numbers. In this paper we study total positivity properties of these numbers. In particular, we prove that the matrix whose entries are the Jacobi–Stirling numbers is totally positive and that each row and each column is a Pólya frequency sequence, except for the columns with (unsigned) numbers of the first kind.     

On the maximum of r-Stirling numbers

Determining the location of the maximum of Stirling numbers is a well-developed area. In this paper we give the same results for the so-called r-Stirling numbers which are natural generalizations of Stirling numbers.     

两类树的独立集多项式的单峰性

研究了图的独立集多项式的单峰性,给出具有爪图结构的几类图的独立集多项式等价的无爪图,并在此基础上证明了两类具有爪图结构的树T(n,n+1,m)和T(I,i+1,k,j,j+1)的独立集多项式具有单峰性,从而为具有爪图结构的其它树的单峰性提供了一个证明方法.     

Incomplete cauchy numbers

By using the restricted Stirling numbers and associated Stirling numbers, we introduce two kinds of incomplete Cauchy numbers, which are generalizations that of the classical Cauchy numbers. We also study several arithmetical and combinatorial properties.     

Riordan阵的差分性质及其应用

本文考虑了Riordan阵的差分性质, 并给出一些涉及经典组合序列的差分恒等式, 包括广义Stirling数, 第一类和第二类Stirling数, 第一类和第二类B型Stirling数以及Gegenbauer-Humbert型多项式.     

Some Polynomial Systems Associated with a Certain Family of Differential Operators

The authors aim at presenting several (presumably new) classes of linear, bilinear, and mixed multilateral generating functions for some general systems of polynomials which are defined by means of a certain family of differential operators. Some of the generating functions considered here are associated with the Stirling numbers of the second kind. Many (known or new) consequences and applications of the results obtained in this paper are also indicated.     

Stirling numbers and integer partitions

In this paper, we prove that the Stirling numbers of both kinds can be written as sums over integer partitions. As corollaries, we rewrite some identities with Stirling numbers of both kinds without Stirling numbers.     

Reciprocity for multirestricted Stirling numbers

Multirestricted Stirling numbers of the second kind count the number of partitions of a given set into a given number of parts, each part being restricted to at most a fixed number of elements. Multirestricted numbers of the first kind are then defined as elements of the matrix inverse to the matrix of corresponding multirestricted numbers of the second kind. The anomalous sign behavior of these latter numbers makes them impervious to combinatorial analysis. In answer to a conjecture that has remained open for several years, we derive a reciprocity law for multirestricted Stirling numbers using algebraic techniques based on polynomial recursions. As corollaries, we obtain new recurrence relations for multirestricted numbers, and a new algebraic derivation of the reciprocity law for Stirling numbers.