Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2011, Article ID 623456, 21 pages
Research Article

On Generalized Bell Polynomials

1Department of Mathematics, Mindanao State University, Marawi City 9700, Philippines
2Department of Mathematics, De La Salle University, Manila 1004, Philippines

Received 18 June 2011; Accepted 25 July 2011

Academic Editor: Garyfalos Papaschinopoulos

Copyright © 2011 Roberto B. Corcino and Cristina B. Corcino. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


It is shown that the sequence of the generalized Bell polynomials is convex under some restrictions of the parameters involved. A kind of recurrence relation for is established, and some numbers related to the generalized Bell numbers and their properties are investigated.

1. Introduction

Hsu and Shiue [1] defined a kind of generalized Stirling number pair with three free parameters which is introduced via a pair of linear transformations between generalized factorials, viz, where (set of nonnegative integers), may be real or complex numbers with () (0, 0, 0), and denotes the generalized factorial of the form In particular, with . Various well-known generalizations were obtained by special choices of the parameters and (cf. [1]), and the generalization of some properties of the classical Stirling numbers such as the recurrence relations the exponential generating function the explicit formula the congruence relation, and a kind of asymptotic expansion was established. As a follow-up study of these numbers, more properties were obtained in [2]. Furthermore, some combinatorial interpretations of were given in [3] in terms of occupancy distribution and drawing of balls from an urn.

Hsu and Shiue [1] also defined a kind of generalized exponential polynomials in terms of generalized Stirling numbers with real or complex numbers as follows: We may call these polynomials generalized Bell polynomials. Note that when , we get the generalized Bell numbers. A kind of generating function of the sequence for the generalized exponential polynomials has been established by Hsu and Shiue, viz, where . In particular, (1.8) gives the generating function for the generalized Bell numbers: Note that, when , . Hence, If we define the polynomial as then its exponential generating function is given by We may call the -Bell polynomial. Hence, with , this yields the exponential generating function for the -Bell numbers. Now, if we use to denote the following limit: then, by (1.5),

Also obtained by Hsu and Shiue is an explicit formula for of the form Consequently, with , we have Note that, by taking , (1.16) gives the explicit formula for -Bell polynomial. When , this gives a kind of the Dobinski formula for -Bell numbers. This reduces further to the Dobinski formula for -Bell numbers [4] when . Moreover, with , we get which is the Dobinski formula for the ordinary Bell numbers [5].

In this paper, a recurrence relation and convexity of the generalized Bell numbers will be established and some numbers related to will be investigated. Some theorems on -Bell polynomials will be established including the asymptotic approximation of the -Bell numbers.

2. More Properties of

Recurrence relation is one of the useful tools in constructing tables of values. The recurrence relation for the ordinary Bell numbers [6] is given by with initial condition . Carlitz’s Bell numbers [7] also satisfy the recurrence relation: with . Note that for and (2.2) will reduce to (2.1). Moreover, Mező [4] obtained certain recurrence relations for the -Bell polynomials, respectively, as The following theorem will generalize all of these recurrence relations.

Theorem 2.1. The generalized exponential polynomials satisfy the following recurrence relation: with . Moreover, the generalized Bell numbers satisfy

Proof. Differentiating both sides of (1.8) with respect to will give Applying binomial theorem and Cauchy’s rule for product of two power series will yield Comparing the coefficients of , we obtain which is precisely equivalent to (1.10).

By taking , Theorem 2.1 yields the recurrence relations for the -Bell polynomials. More precisely, These further give (2.3) when . Surely, (2.2) can be deduced from (2.5) by letting . Furthermore, for , (2.4) gives where . If we let , we get which implies the number of distinct partitions of an -set into 2 nonempty subsets, or simply , the classical Stirling number of the second kind.

Mathematicians have been aware for quite a while that the global behaviour of combinatorial sequences can be used in asymptotic estimates. One of these interesting behaviours is convexity [5]. A real sequence is called convex on an interval (containing at least 3 consecutive integers) when For instance, the sequence of binomial coefficients satisfies the convexity property since This implies that that is, is convex.

The next theorem asserts that the sequence of generalized exponential polynomials as well as the generalized Bell numbers is convex under some restrictions.

Theorem 2.2. The sequence of generalized exponential polynomials with , and possesses the convexity property, viz,

Proof. Since and , we have Multiplying both sides by , we get Thus, making use of (1.16), we obtain (2.16).

Note that, for , (2.16) asserts the convexity of -Bell polynomials which further imply the convexity of -Bell polynomials when . Moreover, letting , (2.16) yields (2.15) and implies the convexity of .

3. A Variation of Generalized Bell Numbers

Let us denote and define The numbers were given combinatorial interpretation in [2], for nonnegative integers , as the number of ways to distribute distinct balls, one ball at a time, into distinct cells, first of which has distinct compartments and the last cell with distinct compartments such that (i)the compartments in each cell are given cyclic ordered numbering,(ii)the capacity of each compartment is limited to one ball,(iii)each successive available compartments in a cell can only have the leading compartment getting the ball,(iv)the first cells are nonempty.

Illustration of (iii)
Suppose the first ball lands in compartment 3 of cell 2. The compartment numbered 4, 5, 6,…, will be closed. And suppose the second ball lands in compartment also of cell 2. Then compartments numbered of cell 2 will be closed.

If cells will be changed to any number of cells with the last cell containing distinct compartments and the rest of the cells each has distinct compartments such that only the last cell could be empty, then this gives the combinatorial interpretation of .

The following theorem contains a kind of exponential generating function for .

Theorem 3.1. The numbers have the following exponential generating function:

Proof. Using the exponential generating function in (1.4), we get This is exactly the desired generating function.

Differentiating both sides of (1.9) with respect to , we yield Since vanishes when and , we have This result is embodied in the following theorem.

Theorem 3.2. The number is equal to

The next theorem provides a recurrence relation for the number which can be used as a quick tool in computing its first values.

Theorem 3.3. The following recurrence relation holds: where .

Proof. Making use of (3.6), we have Summing up both sides from to and using Vandermonde’s formula, we get Hence, we have Now, by (3.6), and . Thus, which is precisely equivalent to (3.7).

Note that when , (3.7) gives while (3.6) gives This implies that

The following theorem gives a kind of congruence relation for with the restriction that . We use to denote the following limit:

Theorem 3.4. Let and be integers. Then for any odd prime and , one has the following congruence relation:

Proof. Note that the explicit formula in (1.14) can be expressed in terms of a difference operator. That is, where denotes the th difference operator. Hence, Thus, Since, by Fermat’s little theorem, is divisible by p, for some integer . Also, since and are of different parity, is divisible by 2. Hence, for some integer . Thus, we have This completes the proof of the theorem.

4. Some Theorems on -Bell Polynomials

The -Bell polynomials have already possessed numerous properties. Some of them are obtained as special case of the properties of . However, there are properties of the ordinary Bell numbers or -Bell numbers which are difficult to establish in but can be done in . For instance, using the rational generating function for in [2] which is given by we can have It can easily be shown that


This can be expressed further as

where is the hypergeometric function which is defined by

where . Applying Kummer’s formula [8],

we obtain the following generating function.

Theorem 4.1. The -Bell polynomials satisfy the following generating function:

It will be interesting if one can also obtain a generating function of this form for .

Now, using the integral identity in [9], and the explicit formula in (1.14), we get Hence, Thus, where . By simple algebraic manipulation, this can further be expressed as follows.

Theorem 4.2. The -Bell polynomials have the following integral representation: where It will also be compelling to establish such integral representation for .

The Bell polynomials are known to be connected to the Poisson distribution. More precisely, can be expressed in terms of the moment of the Poisson random variable with parameter as The exponential generating function for the -Bell polynomials in (1.12) can be written as follows: Hence, we can also express the -Bell polynomials in terms of the following moment: Now, Thus, we have the following theorem.

Theorem 4.3. The -Bell polynomials equal

An extension of the Bell polynomials , defined by Privault [10] as can be expressed in terms of the -Bell polynomials as Using Theorem 4.3, we obtain This is exactly the identity obtained by Privault in [10].

5. An Asymptotic Approximation for

Using the exponential generating function for in (1.12) with and Cauchy’s theorem for integrals, we obtain the integral representation where is the circle ,. Contour integration yields which can be written into the compact form where Define and let Thus (5.3) can be written as

Lemma 5.1. There exists a constant such that

Proof. It can be shown that Since for , we have Since for for , there exists a constant such that . Hence

It will be seen later that as . With the result in Lemma 5.1 we see that and will tend to zero as . Hence Observe that is analytic at .Thus has a Maclaurin series expansion about . This Maclaurin expansion can be written in the form where we define to be the operator . Choose R such that ; that is, satisfies the equation . This is shown to exist in the following lemma.

Lemma 5.2. There exists a unique positive real solution to the equation .

Proof. We can rewrite the given equation in the form The desired solution is the -coordinate of the intersection of the functions and .

It can be seen from the preceding lemma that as . With this choice of , we have We now introduce the following notations: Then and where and .

We have defined as a function of . However, for the moment we consider to be an independent variable and expand into a convergent Maclaurin series expansion of the form where .

Lemma 5.3. There is a constant such that for all ,

Proof. We see that which tends to as . From this, it follows that there is a constant satisfying (5.18).

Now, it will follow from Lemma 5.3 that the radius of convergence of (5.17) becomes large when is near zero. Thus, is within the domain of convergence.

With , where

Note that as . Furthermore with as . From these facts and the known asymptotic expansion of the function of the form the replacement of by in (5.16) is easily justified (see [11]). Hence It remains to show that as , that is, . From a lemma in [12], . Thus, where .

Now, for , we have

Let and denote the denominator and the numerator, respectively, in (5.27). Since and , we have Hence for sufficiently large , . Moreover, exists and tends to zero as . Therefore, Thus, . Consequently, Since for odd , and , as a polynomial in , contain only odd powers of , it follows that

Calculation yields Taking the first two terms of the asymptotic expansion of (5.32), we have Since and , Let denote, respectively, the integrals in (5.35). Then evaluating the last two integrals by parts and since , we obtain Substituting the results in (5.35) and simplifying, we obtain where Since and , Using Stirling's approximation for , viz, we obtain Using (5.37), we obtain


The authors wish to thank the referee for reading and evaluating the manuscript. They would also like to thank the Office of the President and the Office of the Vice Chancellor for Research and Extension of Mindanao State University-Main Campus for the support extended to this research.


  1. L. C. Hsu and P. J.-S. Shiue, “A unified approach to generalized Stirling numbers,” Advances in Applied Mathematics, vol. 20, no. 3, pp. 366–384, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. R. B. Corcino, “Some theorems on generalized Stirling numbers,” Ars Combinatoria, vol. 60, pp. 273–286, 2001. View at Google Scholar · View at Zentralblatt MATH
  3. R. B. Corcino, L. C. Hsu, and E. L. Tan, “Combinatorial and statistical applications of generalized Stirling numbers,” Journal of Mathematical Research and Exposition, vol. 21, no. 3, pp. 337–343, 2001. View at Google Scholar · View at Zentralblatt MATH
  4. I. Mező, “The r-Bell numbers,” Journal of Integer Sequences, vol. 14, no. 1, 2011. View at Google Scholar
  5. L. Comtet, Advanced Combinatorics, D. Reidel Publishing Co., Dordrecht, The Netherlands, 1974.
  6. S. M. Tanny, “On some numbers related to the Bell numbers,” Canadian Mathematical Bulletin, vol. 17, no. 5, pp. 733–738, 1975. View at Google Scholar
  7. L. Carlitz, “Degenerate stirling, bernoulli and eulerian numbers,” Utilitas Mathematica, vol. 15, pp. 51–88, 1979. View at Google Scholar · View at Zentralblatt MATH
  8. M. Abramowitz and I. A. Stegun, Eds., Handbook of Mathematical Functions, with Formulas, Graphs, and Mathematical Tables, Dover Publications Inc., New York, NY, USA, 9th edition, 1972.
  9. D. Callan, “Cesaro's integral formula for the Bell numbers (corrected),”
  10. N. Privault, “Generalized Bell polynomials and the combinatorics of Poisson central moments,” Electronic Journal of Combinatorics, vol. 18, no. 1, 2011. View at Google Scholar · View at Zentralblatt MATH
  11. E. T. Copson, Asymptotic Expansions, Cambridge University Press, New York, NY, USA, 1965.
  12. C. A. Charalambides and M. Koutras, “On the differences of the generalized factorials at an arbitrary point and their combinatorial applications,” Discrete Mathematics, vol. 47, no. 2-3, pp. 183–201, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH