1. Introduction
In this research, we establish limit theorems for combinatorial numbers satisfying a class of triangular arrays, extending, particularly, the investigations of Canfield [
1], Kyriakoussis [
2], Kyriakoussis and Vamvakari [
3,
4,
5,
6], and Belovas [
7]. We consider numbers, which are defined by a bivariate linear recurrence with bivariate linear coefficients.
Definition 1. Let Ψ be a real non-zero matrix (generating matrix),then The numbers defined above involve binomial coefficients,
k-permutations of
n without repetition, Morgan numbers, Stirling numbers of the first kind and the second kind, non-central Stirling numbers, Eulerian numbers, Lah numbers, as well as some generalizations of the numbers mentioned above (see [
8,
9] and the references therein).
The paper is organized as follows. The first part is the introduction. In
Section 2, we receive generating functions and analytic expressions for particular numbers, satisfying a class of triangular arrays, using general partial differential equations.
Section 3 establishes a connection between numbers satisfying a class of triangular arrays and generalized Lah numbers. The result is used to obtain generating functions and analytic expressions for other numbers, satisfying a class of triangular arrays. In
Section 4, we prove asymptotic normality for the said numbers and specify the rates of convergence. In
Section 5, we establish central limit theorems for numbers satisfying a class of triangular arrays associated with Laguerre polynomials and determine convergence rates to the limiting distribution.
Section 6 of the study contains concluding remarks.
Throughout this paper, we denote by
the binomial coefficients, by
the gamma function,
stands for the exponential integral,
and
stands for the cumulative distribution function of the standard normal distribution,
Let
be the generalized Laguerre polynomials,
The generating function of the generalized Laguerre polynomials is [
10]
All limits, unless specified, are taken as .
2. Generating Functions and Analytic Expressions of the Combinatorial Numbers
We may view the recurrent expression for the numbers
(
2) as a partial difference equation with linear coefficients. First, let us introduce the semi-exponential generating function of the numbers,
This expression, contrary to ordinary or exponential ones, leads us to a first-order characteristic differential equation (see Equation (
6) in Theorem 1). In contrast, ordinary and exponential generating functions satisfy second-order partial differential equations.
Definition 2. For the numbers satisfying a class of triangular arrays (2), we define their dual counterparts . Remark 1. In view of Definintion 2, the generating matrix of the dual numbers is Lemma 1. The double semi-exponential generating function of the dual numbers (5) equals . Proof. By Definition 2, we have
yielding us the statement of the lemma. □
In [
7], we have received subsequent theorems (see Theorems 1 and 2) for the generating functions of the numbers satisfying a class of triangular arrays (
2).
Theorem 1 (Belovas).
The generating function satisfies the linear first-order partial differential equationwith the initial condition . Remark 2. Solving the linear first-order partial differential Equation (6), we obtain the generating function . The formal Taylor series in two variables for the generating function equals Hence, the partial differentiation of the double semi-exponential generating function at yields us the analytic expressions of the numbers Theorem 2 (Belovas).
For , numbers generated by the matrix- (i)
have the generating function - (ii)
and the analytic expression
Using a substitution
, we can reduce the linear partial differential Equation (
6) into its homogeneous form. First, we formulate an auxiliary lemma [
11].
Lemma 2. - (i)
Let ; then, the principal integral of the first-order partial differential equationiswhere - (ii)
Let;
then, the principal integral of the first order partial differential equationiswhere and are arbitrary constants.
Proof. - (i)
See 2.9.3.4 in Polyanin et al. [
11];
- (ii)
See 2.9.3.10 in Polyanin et al. [
11].
□
Theorem 3. Under conditions of Theorem 1, the function satisfies a linear first-order homogeneous partial differential equation
- (i)
for,
with the initial condition The principal integral of Equation (15) iswhere - (ii)
for,
,
The principal integral of Equation (18) is - (iii)
for,
,
The principal integral of Equation (20) is
Proof. First, substituting
into (
6), we obtain
Thus, since
, we have
yielding us the first part of the first statement of the lemma.
Next, substituting
into (
11) and (
12) of Lemma 2, we receive the second part of the first statement of the lemma.
The second and the third statements are proved analogically. □
Corollary 1. - (i)
Let,
and;
then, the numbers generated by the matrix Ψ (1) have the generating function - (ii)
For,
the numbers generated by the matrixhave the generating function
Proof. First, by (ii) of Lemma 2, we receive the principal integral
Next, by (
16), we have the norming function
Hence, the solution to the corresponding Cauchy problem (
15) and (
16) is
Recollecting that and simplifying the expression, we obtain the first statement of the lemma.
Second, by (
19) of Theorem 3, the general solution of the corresponding differential equation is
Using the general solution and the condition
we obtain the solution to the Cauchy problem,
yielding us the statement of the lemma,
□
In the next section, we will use the following auxiliary result [
7].
Theorem 4 (Belovas).
Numbers generated by the matrix- (i)
have the generating function - (ii)
and the analytic expression
where
,
,
,
.
4. Limit Theorems for Numbers Satisfying a Class of Triangular Arrays
Limit theorems for numbers satisfying a class of triangular arrays can be established using properties of ordinary or semi-exponential generating functions (cf. [
13,
14]). Let
be an integral random variable with the probability mass function
Definition 4. Numbers are asymptotically normal with mean and variance if We use a general central limit theorem by Bender [
15], based on the nature of the generating function
, to prove the asymptotic normality of the numbers.
Lemma 4 (Bender).
Let have a power series expansionwith non-negative coefficients. Suppose there exists- (i)
Ancontinuous and non-zero near 0,
- (ii)
Anwith bounded third derivative near 0,
- (iii)
A non-negative integer m, and
- (iv)
such that
is analytic and bounded for If , then (34) holds with and . Let us formulate the central limit theorem.
Theorem 5. Let the coefficients be positive and be non-negative, then the numbers generated by the matrixare asymptotically normal with mean and variance , where Proof. Let us transform the numbers
into
,
. For the numbers
we have
By (
30) of Corollary 3, the generating function of the numbers is
The crucial part of the proof is the selection of functions
and
. Let
(cf. Lemma 3) be the root of the function
i.e.,
Calculating the derivatives, we receive
Note that , since for , we have .
As Bender indicates (see
Section 3 in [
15]), the easiest way for verifying the (
36) and (
37) conditions of Lemma 4 is to show that
is continuous for
and
z in the set
for some
. Since this is a compact set,
f and hence (
36) is bounded here. For
, we can expand
in a Laurent series about
and show that the coefficient of the error term is bounded.
Let us consider the function
from (
36) of Lemma 4 as the limit
Calculating
, we obtain
The function
is analytic and bounded for
Thus, conditions (i)–(iv) of Lemma 4 are satisfied. This concludes the proof of the theorem. □
Remark 6. Note that the expression for the mean μ in Theorem 5 (see (39)) is the generating function of the Bernoulli numbers , Remark 7. For the numbers generated by the matrixwe havewhere and . Theorem 5 allows us to receive a symmetric result for the dual numbers (
5). We can formulate the subsequent corollary.
Corollary 4. Let the coefficients be positive and be non-negative; then, the numbers generated by the matrixare asymptotically normal with mean and variance , where Further, we use Hwang’s result on the convergence rate in the central limit theorem for combinatorial structures (see Corollary 2 from
Section 4 in [
16]) to establish central limit theorems and specify the rate of convergence to the limiting distribution.
The moment generating function of the random variable
(
33) equals
Combining the definition of the semi-exponent generating function (
4) and (
41), we obtain
where
Thus, the partial differentiation of the double semi-exponential generating function
at
yields us the moment generating function
Since
, the formula for the sum
follows,
Lemma 5 (Hwang).
Let be a probability generating function of the random variable , taking only non-negative integral values, with expectation and variance . Suppose that, for each fixed , is a Hurwitz polynomial. If , then, satisfies Theorem 6. Suppose that is the cumulative distribution function of the random variable with the probability mass function (33) of the numbers generated by the matrix Let the coefficients be positive, andthen The expectation and the variance are equal torespectively. Proof. By (
8) of Theorem 3, the generating function of numbers (
45) is
Let
=
. For the numbers
, we have the generating function
. Note that
thus,
(cf.(
41)). Taking into account the formula for the
nth derivative,
we calculate the partial derivative of the double semi-exponential generating function,
Hence, the moment generating function (cf. (
42)) and the probability generating function are
respectively. The Hurwitz polynomial is a polynomial whose zeros are located in the left halfplane of the complex plane or on the imaginary axis. Since
,
is a Hurwitz polynomial.
Note that the moment generating function
is the moment generating function of the binomial distribution
with parameters
Thus,
with
, yielding us, by Lemma 5, the statement of the theorem. □
Theorem 6 allows us to receive the symmetric result for the dual numbers. We can formulate the subsequent corollary.
Corollary 5. Suppose that is the cumulative distribution function of the random variable with the probability mass function (33) of the numbers generated by the matrix Let the coefficients be positive, and , then The expectation and the variance are equal torespectively.