Abstract
In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of convergence to the limiting (normal) distribution, as well as a new proof of the local limit theorem for the numbers of the tribonacci triangle.
Keywords:
tribonacci matrix; triangular array; limit theorems; rate of convergence; generating functions MSC:
05A15; 39A06; 60F05
1. Introduction
The tribonacci triangle (also known as the Delannoy triangle [1], cf. OEIS Number sequence A008288 [2]) was introduced to derive the expansion of the tribonacci numbers (OEIS Number sequence A000073 [3]). The sum of the elements along a rising diagonal of this triangle (see Table 1) equals the tribonacci number: .
Table 1.
The tribonacci triangle ( numbers, see Equation (1)).
Numbers satisfying the triangle can be defined by the following recurrent expression:
Barry [4] showed that the closed form for numbers satisfying the tribonacci triangle is
The tribonacci (Delannoy)-like triangles and their generalizations are intensively examined nowadays. Amrouche, Belbachir and Ramírez [1,5] have studied the unimodality of sequences located in the triangle’s infinite transversals and derived the explicit formulation of the linear recurrence sequence satisfied by the sum of the elements lying over any finite ray of the generalized tribonacci matrix. Kuhapatanakul [6] has examined the connection between a generalized tribonacci triangle and a generalized Fibonacci sequence. The total positivity of Delannoy-like triangles has been considered by Mu and Zheng [7]. Yang, Zheng and Yuan [8] have studied the inverses of the generalized Delannoy matrices.
The present research extends the investigations of the asymptotics for Delannoy numbers undertaken by Noble [9,10] and Wang, Zheng and Chen [11] (as well as our research into central and local limit theorems for combinatorial numbers satisfying a class of triangular arrays [12,13,14,15]). Noble has obtained asymptotic expansions for the central weighted Delannoy numbers () and the numbers along the the diagonal with slope 2 (). Wang, Zheng and Chen showed the asymptotic normality of Delannoy numbers, using the properties of the zeroes of Delannoy polynomials. In this work we provide a new constructive proof of the central limit theorem for the numbers of the tribonacci triangle, specifying the rate of convergence to the limiting distribution (in the process we receive the closed exact expression for the variance of the random variable, associated to the numbers of the tribonacci triangle, missing in the work of Wang et al.), together with a new proof of the local limit theorem.
The paper is organized in the following way. The first part is the introduction. In the second part, we specify the moment-generating function of the numbers of the tribonacci triangle and calculate exact expressions for the expectation and the variance of the random variable, associated to the numbers of the tribonacci triangle. The third and fourth sections are devoted to the central and local limit theorems.
Throughout this paper, we denote by the cumulative distribution function of the normal distribution with the mean and the standard deviation ; by we denote the corresponding density function.
All limits in the paper, unless specified, are taken as .
2. Moment-Generating Function
Let us consider the generating function of the numbers given by Equation (1),
Lemma 1.
(Alladi and Hoggatt [16]). The bivariate generating function of the numbers of the tribonacci triangle is
Let be an integral random variable with the probability mass function
The moment-generating function of the random variable equals
where stands for the sum of the n-th row of the triangle,
Thus, the partial differentiation of the generating function at , yields us the moment-generating function
Note that, since , we have a formula for the sum of the n-th row,
Lemma 2.
The moment-generating function of the random variable , associated to the numbers of the tribonacci triangle given by Equation (4), is
here
Proof.
Next,
Lemma 3.
The expectation and the variance of the random variable , associated to the numbers of the tribonacci triangle from Equation (4), are
respectively.
3. Central Limit Theorem
Let, by Hwang [17], be a sequence of integral random variables, and
Here O-term is uniform for , and
- (i)
- , with and analytic for and independent of n, ;
- (ii)
- ;
- (iii)
- .
We apply the following Hwang’s result [17] to prove the central limit theorem for the numbers of Equation (1) and specify the rate of convergence to the limiting distribution.
Theorem 1.
(Hwang). Under assumptions (i)–(iii),
uniformly with respect to x, .
Next we prove an auxiliary lemma.
Lemma 4.
For ,
Proof.
Let
Calculating the first derivative, we obtain
Solving the equation
we get
yielding us the stationary point . Since , we have , thus concluding the proof.
□
The following theorem shows that the numbers of the tribonacci triangle from Equation (1) are asymptotically normal, and identifies the rate of convergence to the limiting distribution.
Theorem 2.
Suppose that is the cumulative distribution function of the random variable , then
uniformly with respect to x, .
Proof.
The logarithm of the moment-generating function equals
By Lemma 4,
Thus,
Here . Note that the functions , , and satisfy the conditions (i)–(iii). Indeed,
Hence,
yielding us, by Equation (16), the statement of the theorem. □
4. Local Limit Theorem
We apply a general local limit theorem, based on the nature of the bivariate generating function of Equations (2) and (3).
Theorem 3.
(Bender [18]) Let have a power series expansion
with non-negative coefficients and let be real numbers. Define
Suppose there exists , a non-negative integer m, and functions , such that
- (i)
- anis continuous and non-zero for,
- (ii)
- anis non-zero and has a bounded third derivative for,
- (iii)
- forandfunctionis analytic and bounded,
- (iv)
- for,
- (v)
- is analytic and bounded for
Then we have
uniformly for , where
Now we can proceed with the local limit theorem for the numbers of the tribonacci triangle.
Theorem 4.
Let
then for all k, such that
we have the following asymptotic expression for the numbers of the tribonacci triangle in Equation (1),
Proof.
By Lemma 1, the generating function is
Let (cf. Theorem 3) be a root of the function
This function has two roots (cf. Equation (10)),
Calculating derivatives, we obtain
Note that by Theorem 1 (Bender [18]), the mean and . Let . Now we have
and
Next, consider the function (cf. Equation (17)) as the limit
Here is the order of the pole. Note that, if the pole is simple, then . Now we obtain
Hence, conditions (i)–(iii) and (v) of Theorem 3 are satisfied. We check the condition (iv) evaluating . Using Equations (21) and (22), we obtain
Indeed, we have
since
Here .
We obtain the parameter by solving the equation
Here . Hence, Equation (24) is equivalent to
Thus,
and
Here
Assume
Using Equation (19), we get
Thus, substituting the result into Equation (26) yields
Next, consider the logarithm of from Equation (25),
Using Taylor series expansions, we obtain for large enough n,
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
- Amrouche, S.; Belbachir, H. Unimodality and linear recurrences associated with rays in the Delannoy triangle. Turk. J. Math. 2020, 44, 118–130. [Google Scholar] [CrossRef]
- Square Array of Delannoy Numbers D(i,j) (i ⩾ 0, j ⩾ 0) Read by Antidiagonals. OEIS Number Sequence A008288. The Online Encyclopedia of Integer Sequences. Available online: https://oeis.org/A008288 (accessed on 15 April 2021).
- Tribonacci Numbers: a(n) = a(n − 1) + a(n − 2) + a(n − 3) for n ⩾ 3 with a(0) = a(1) = 0 and a(2) = 1. OEIS Number Sequence A000073. The Online Encyclopedia of Integer Sequences. Available online: https://oeis.org/A000073 (accessed on 15 April 2021).
- Barry, P. On integer-sequence-based constructions of generalized Pascal triangles. J. Integer Seq. 2006, 9, 06.2.4. [Google Scholar]
- Amrouche, S.; Belbachir, H.; Ramírez, J.L. Unimodality, linear recurrences and combinatorial properties associated to rays in the generalized Delannoy matrix. J. Differ. Equ. 2019, 25, 1200–1215. [Google Scholar] [CrossRef]
- Kuhapatanakul, K. Some connections between a generalized Tribonacci triangle and a generalized Fibonacci sequence. Fibonacci Q. 2012, 50, 44–50. [Google Scholar]
- Mu, L.; Zheng, S. On the total positivity of Delannoy-like triangles. J. Integer Seq. 2006, 20, 17.1.6. [Google Scholar]
- Yang, S.; Zheng, S.; Yuan, S.; He, T. Schröder matrix as inverse of Delannoy matrix. Linear Algebra Appl. 2013, 439, 3605–3614. [Google Scholar] [CrossRef]
- Noble, R. Asymptotics of a family of binomial sums. J. Number Theory 2010, 130, 2561–2585. [Google Scholar] [CrossRef][Green Version]
- Noble, R. Asymptotics of the weighted Delannoy numbers. Int. J. Number Theory 2012, 8, 175–188. [Google Scholar] [CrossRef]
- Wang, Y.; Zheng, S.; Chen, X. Analytic aspects of Delannoy numbers. Discrete Math. 2019, 342, 2270–2277. [Google Scholar] [CrossRef]
- Belovas, I. A central limit theorem for coefficients of the modified Borwein method for the calculation of the Riemann zeta-function. Lith. Math. J. 2019, 59, 17–23. [Google Scholar] [CrossRef]
- Belovas, I. A local limit theorem for coefficients of modified Borwein’s method. Glas. Mat. 2019, 54, 1–9. [Google Scholar] [CrossRef][Green Version]
- Belovas, I.; Sabaliauskas, M. Series with binomial-like coefficients for the evaluation and 3D visualization of zeta functions. Informatica 2020, 31, 659–680. [Google Scholar] [CrossRef]
- Belovas, I.; Sakalauskas, L. Limit theorems for the coefficients of the modified Borwein method for the calculation of the Riemann zeta-function values. Colloq. Math. 2019, 151, 217–227. [Google Scholar] [CrossRef]
- Alladi, K.; Hoggatt, V.E., Jr. On Tribonacci numbers and related functions. Fibonacci Q. 1977, 15, 42–45. [Google Scholar]
- Hwang, H.-K. On convergence rates in the central limit theorems for combinatorial structures. Eur. J. Comb. 1998, 19, 329–343. [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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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/).