Abstract
In this paper, we study limit theorems for numbers satisfying a class of triangular arrays, which are defined by a bivariate linear recurrence with bivariate linear coefficients. We obtain analytical expressions for the semi-exponential generating function of several classes of the numbers, including combinatorial numbers associated with Laguerre polynomials. We apply these results to prove the numbers’ asymptotic normality and specify the convergence rate to the limiting distribution.
Keywords:
limit theorems; combinatorial numbers; generating functions; asymptotic enumeration; asymptotic normality; Laguerre polynomials MSC:
05A15; 05A16; 33C45; 39A14; 60F05
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 equation
with 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
Proof.
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)
- (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
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 expressionwhere , , , .
3. Numbers Satisfying a Class of Triangular Arrays and Generalized Lah Numbers
Definition 3.
Generalized Lah numbers [12] are defined by the recurrent expression
here and for .
Remark 3.
For linear in n and k, we have , generated by the matrix
Lemma 3.
Proof.
We induct on n. By Definition 1, Definition 3, and (26), we have (see Table 1) that the statement (27) holds for and .
Table 1.
Numbers , and for .
Remark 4.
Note that the coefficient (26) is linear if
- (i)
- , then
- (ii)
- and , then
Corollary 2.
For , numbers generated by the matrix
- (i)
- have the generating function
- (ii)
- and the analytic expression
Proof.
Remark 5.
Note that Corollary 2 yields us the analytic expression for the ordinary Lah numbers, which are generated by the matrix
Next, we establish the following result.
Corollary 3.
For , numbers generated by the matrix
- (i)
- have the generating function
- (ii)
- and the analytic expressionwhere and .
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
is analytic and bounded for
(Bender). Let have a power series expansion
with 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
Define
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 matrix
are 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
Hence, by Lemma 4,
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 matrix
we have
where 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 matrix
are 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
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, and
then
The expectation and the variance are equal to
respectively.
Proof.
Let
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 to
respectively.
5. Limit Theorems for Numbers Satisfying a Class of Triangular Arrays Associated with Laguerre Polynomials
We will use the following result on asymptotics of ratios of Laguerre polynomials [10].
Lemma 6
(Deaño et al.). Let and ; then, the ratio of arbitrary Laguerre polynomials has an asymptotic expansion
where the first coefficients are
Theorem 7.
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 to
respectively. Here, and .
Proof.
First, we derive the moment generating function. Let =. For the numbers , we have the generating function . Note that (cf. (41)). By Corollary 2 (see (28)), the semi-exponential generating function equals
Hence, the probability-generating functon is
The Hurwitz polynomial is a polynomial whose zeros are located in the left halfplane of the complex plane or on the imaginary axis. If is non-negative, then all roots of the generalized Laguerre polynomial are real and positive. Since , the polynomial (65) is a Hurwitz polynomial.
Next, we calculate the expectation and the variance . The derivatives of the generalized Laguerre polynomials satisfy the following expression,
Hence,
Using the properties of the generalized Laguerre polynomials,
We obtain the expectation
and the variance
Thus, , yielding us, by Lemma 5, the statement of the theorem. □
Theorem 7 allows us to receive the symmetric result for the dual numbers. We can establish the following corollary.
Corollary 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, then
The expectation and the variance are equal to
where and .
6. Conclusions
We have proved limit theorems for three categories of numbers satisfying a class of triangular arrays (see Theorems 5 and 6), which are defined by a bivariate linear recurrence with bivariate linear coefficients, including combinatorial numbers associated with Laguerre polynomials (see Theorem 7). We have established the asymptotic normality of these combinatorial numbers and have specified convergence rates to the limiting distribution. Apart from the theoretical value (generating functions are a very important tool to derive the identities, connections, and interpolation functions for polynomials, or limit theorems for corresponding combinatorial numbers), these results can be applied to the construction of efficient algorithms for the calculation of the values of special functions. We have used similar limit theorems for the combinatorial numbers in calculations of the Riemann zeta function (see Theorem 3 in [14] and Algorithm 3 in [17]). Moreover, the presented asymptotic normality results may have also an important utilization in choosing a suitable cumulative distribution function or a cumulative intensity function for models in insurance [18].
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The author would like to thank the anonymous reviewer for the careful reading of the manuscript and providing constructive comments and suggestions, which have helped to improve the quality of the paper.
Conflicts of Interest
The author declares no conflict of interest.
References
- Canfield, R.E. Central and local limit theorems for the coefficients of polynomials of binomial type. J. Comb. Theory Ser. A 1977, 23, 275–290. [Google Scholar] [CrossRef]
- Kyriakoussis, A. A central limit theorem for numbers satisfying a class of triangular arrays. Discret. Math. 1984, 51, 41–46. [Google Scholar] [CrossRef][Green Version]
- Kyriakoussis, A.; Vamvakari, M.G. Asymptotic normality of the coefficients of polynomials related to the classical system orthogonal ones. Discret. Math. 1999, 205, 145–169. [Google Scholar] [CrossRef][Green Version]
- Kyriakoussis, A.; Vamvakari, M.G. Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones. Comput. Appl. Math. 2001, 133, 455–463. [Google Scholar] [CrossRef][Green Version]
- Kyriakoussis, A.; Vamvakari, M.G. Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones. J. Stat. Plan. Inference 2002, 101, 191–202. [Google Scholar] [CrossRef]
- Kyriakoussis, A.; Vamvakari, M.G. A unified treatment for the asymptotic normality of the coefficients of polynomials related to orthogonal ones. J. Stat. Plan. Inference 2005, 135, 148–157. [Google Scholar] [CrossRef]
- Belovas, I. Limit theorems for numbers satisfying a class of triangular arrays. Glas. Mat. Ser. III 2021, 56, 195–223. [Google Scholar] [CrossRef]
- Maltenfort, M. New definitions of the generalized Stirling numbers. Aequat. Math. 2020, 94, 169–200. [Google Scholar] [CrossRef]
- Nyul, G.; Rácz, G. The r-Lah numbers. Discret. Math. 2015, 338, 1660–1666. [Google Scholar] [CrossRef]
- Deaño, A.; Huertas, E.J.; Marcellán, F. Strong and ratio asymptotics for Laguerre polynomials revisited. J. Math. Anal. Appl. 2013, 403, 477–486. [Google Scholar] [CrossRef]
- Polyanin, A.D.; Zaitsev, V.F.; Moussiaux, A. Handbook of First-Order Partial Differential Equations; CRC Press: London, UK, 2002; p. 520. [Google Scholar] [CrossRef]
- Platonov, M.L. Kombinatornye Chisla Klassa Otobrazhenii i Ikh Prilozheniya [Combinatorial Numbers of the Mapping Class and Their Applications]; Nauka Publ.: Moscow, Russia, 1979; p. 153. [Google Scholar]
- Belovas, I. A local limit theorem for coefficients of modified Borwein’s method. Glas. Mat. Ser. III 2019, 54, 1–9. [Google Scholar] [CrossRef][Green Version]
- Belovas, I.; Sabaliauskas, M. Series with binomial-like coefficients for evaluation and 3D visualization of zeta functions. Informatica 2020, 31, 659–680. [Google Scholar] [CrossRef]
- Bender, E.A. Central and local limit theorems applied to asymptotic enumeration. J. Comb. Theory Ser. A 1973, 15, 91–111. [Google Scholar] [CrossRef]
- Hwang, H.K. On Convergence Rates in the Central Limit Theorems for Combinatorial Structures. Eur. J. Comb. 1998, 19, 329–343. [Google Scholar] [CrossRef]
- Belovas, I.; Sakalauskas, L.; Starikovičius, V. A method for accelerated computation of the Riemann zeta function on the complex plane. Publ. Math. Debr. 2022, 100, 167–184. [Google Scholar] [CrossRef]
- Maciaka, M.; Okhrin, O.; Pešta, M. Infinitely stochastic micro reserving. Insur. Math. Econ. 2021, 100, 30–58. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).