Next Article in Journal
Change Point Detection Using Penalized Multidegree Splines
Next Article in Special Issue
On q-Horn Hypergeometric Functions H6 and H7
Previous Article in Journal
Applying Set Theory
Previous Article in Special Issue
Quadruple Integral Involving the Logarithm and Product of Bessel Functions Expressed in Terms of the Lerch Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Expressions for Sums of Products of the Catalan Numbers

1
College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China
2
Faculty of Science, Kunming University of Science and Technology, Kunming 650500, China
3
School of Mathematics and Information Science, Neijiang Normal University, Neijiang 641100, China
*
Author to whom correspondence should be addressed.
Axioms 2021, 10(4), 330; https://doi.org/10.3390/axioms10040330
Submission received: 28 October 2021 / Revised: 27 November 2021 / Accepted: 29 November 2021 / Published: 1 December 2021
(This article belongs to the Special Issue p-adic Analysis and q-Calculus with Their Applications)

Abstract

:
In this paper, we perform a further investigation for the Catalan numbers. By making use of the method of derivatives and some properties of the Bell polynomials, we establish two new expressions for sums of products of arbitrary number of the Catalan numbers. The results presented here can be regarded as the development of some known formulas.

1. Introduction

As is well known, the famous Catalan numbers C n count the number of ways to triangulate a regular polygon with n + 2 sides. These natural numbers are usually given by the formula
C n = 1 n + 1 2 n n ( n 0 ) .
In fact, the Catalan numbers can be also defined by the generating function
2 1 + 1 4 t = n = 0 C n t n ,
or defined recursively by
C 0 = 1 , C n + 1 = k = 0 n C k C n k ( n 0 ) .
The Catalan numbers are probably the most frequently encountered sequence of numbers, and have been studied in depth in many papers and monographs; see, for example [1,2,3,4,5].
Recently, some authors have taken lively interest in dealing with some identities for the Catalan numbers and their generalizations. For example, Mahmoud and Qi [6] used the generalized hypergeometric series to find three identities for the Catalan-Qi numbers, which generalize Touchard’s [7], Jonah’s [8] and Koshy’s [9] identities for the Catalan numbers. Qi and Cerone [10] used the properties of the Gamma function to establish some connections between the Catalan-Qi numbers and the Fuss–Catalan numbers. Kim and Kim [11] explored the family of inhomogeneous linear differential equations arising from the generating function of the Catalan–Daehee numbers, by virtue of which they obtained some new identities for the Catalan–Daehee numbers and the Catalan numbers. We here mention [12,13,14,15] for some interesting identities for the Catalan polynomials and numbers. More recently, Zhang and Chen [16] considered the calculating problem of the sums of products of arbitrary number of the Catalan numbers, and showed that for positive integer m and non-negative integer n,
k 1 + + k 2 m + 1 = n k 1 , , k 2 m + 1 0 C k 1 C k 2 m + 1 = 1 ( 2 m ) ! k = 0 m A ( m , k ) j = 0 min ( n , k ) k j ( 4 ) j ( m + n + k j ) ! ( n j ) ! C m + n + k j ,
and
k 1 + + k 2 m = n k 1 , , k 2 m 0 C k 1 C k 2 m = 1 ( 2 m 1 ) ! k = 0 m 1 B ( m , k + 1 ) j = 0 n k + 1 2 j ( 4 ) j ( m + n + k j ) ! ( n j ) ! × C m + n + k j ,
where α k are the general binomial coefficients given for complex number α and non-negative integer k by
α 0 = 1 , α k = α ( α 1 ) ( α 2 ) ( α k + 1 ) k ! ( k 1 ) ,
A ( m , k ) is a sequence of numbers satisfying the recurrence relation
A ( m + 1 , k ) = A ( m , k 1 ) ( 8 k + 2 ) A ( m , k ) + ( 4 k + 2 ) ( 4 k + 4 ) A ( m , k + 1 )
with the initial values A ( 1 , 0 ) = 2 , A ( m , m ) = 1 , and B ( m , k + 1 ) is another sequence of numbers satisfying the recurrence relation
B ( m + 1 , k ) = B ( m , k 1 ) ( 8 k 2 ) B ( m , k ) + 4 k ( 4 k + 2 ) B ( m , k + 1 )
with the initial values B ( m , 0 ) = 0 , B ( m , m ) = 1 . After that, Zhang and Chen [17] used inductive hypotheses to determine the explicit expressions of A ( m , k ) and B ( m , k + 1 ) appearing in (4) and (5).
Motivated and inspired by the work of the above authors, we perform a further investigation for the Catalan numbers in this paper. By making use of the method of derivatives and some properties of the Bell polynomials, we establish the following two new expressions for sums of products of arbitrary number of the Catalan numbers.
Theorem 1.
Let m , n be non-negative integers with m 1 . Then
k 1 + + k m = n k 1 , , k m 0 C k 1 C k m = ( 4 ) n k = 0 n m + k 1 k 1 2 k j = 0 k ( 1 ) j k j j 2 n .
Theorem 2.
Let m , n be positive integers. Then
k 1 + + k m = n k 1 , , k m 0 C k 1 C k m = k = 1 n ( ( m + 1 ) ( n + 1 k ) n 1 ) ( 4 ) k 1 C n + 1 k i = 0 k 1 m + i 1 i 1 2 i × j = 0 i ( 1 ) j i j j 2 k 1 .
The following second and third section is contributed to the detailed proof of Theorems 1 and 2, respectively.

2. The Proof of Theorem 1

We shall give two different proofs of Theorem 1 in this section.
The First Proof of Theorem 1.
Clearly, from (2) and the Cauchy product, we discover that for positive integer m and non-negative integer n,
n ! k 1 + + k m = n k 1 , , k m 0 C k 1 C k m = 2 m n t n ( 1 ( 1 + 1 4 t ) m ) | t = 0 .
Let F ( u ) = 1 ( 1 + u ) m and G ( t ) = 1 4 t with u = G ( t ) . The famous Faà di Bruno formula states that for non-negative integer n (see, e.g., ([18], pp. 137–139)),
F ( n ) ( G ( t ) ) = k = 0 n F ( k ) ( u ) B n , k ( G ( 1 ) ( t ) , G ( 2 ) ( t ) , , G ( n k + 1 ) ( t ) ) ,
where f ( n ) ( x ) denotes the n-th derivative for the function f ( x ) with respect to x, and B n , k ( x 1 , x 2 , , x n k + 1 ) are the partial Bell polynomials. Observe that for non-negative integer k,
F ( k ) ( u ) = ( m ) ( m 1 ) ( m k + 1 ) ( 1 + u ) m k = ( 1 ) k k ! m + k 1 k 1 ( 1 + u ) m + k ,
which implies
F ( k ) ( u ) | t = 0 = ( 1 ) k k ! m + k 1 k 1 2 m + k .
Similarly, for positive integer k,
G ( k ) ( t ) | t = 0 = 1 2 ( 1 2 1 ) ( 1 2 k + 1 ) ( 1 4 t ) 1 2 k ( 4 ) k | t = 0 = 2 k ( 2 k 3 ) ! ! ,
where ( 2 n 1 ) ! ! is the double factorial given for non-negative integer n by ( 1 ) ! ! = 1 and ( 2 n 1 ) ! ! = ( 2 n 1 ) ( 2 n 3 ) 3 · 1 for positive integer n. It follows from (11) that
B n , k ( G ( 1 ) ( t ) , G ( 2 ) ( t ) , , G ( n k + 1 ) ( t ) ) | t = 0 = B n , k ( 2 ( 1 ) ! ! , 2 2 1 ! ! , , 2 n k + 1 ( 2 ( n k + 1 ) 3 ) ! ! ) = ( 1 ) k 2 n B n , k ( ( 1 ) ! ! , 1 ! ! , , ( 2 ( n k + 1 ) 3 ) ! ! ) ,
where we have used the formula (see, e.g., ([18], p. 135))
B n , k ( a b x 1 , a b 2 x 2 , , a b n k + 1 x n k + 1 ) = a k b n B n , k ( x 1 , x 2 , , x n k + 1 ) .
We next evaluate the special values of the partial Bell polynomials on the right side of (12). Since the partial Bell polynomials can be defined by the series
1 k ! ( m = 1 x m t m m ! ) k = n = k B n , k ( x 1 , x 2 , , x n k + 1 ) t n n ! ,
by taking x m = ( 2 m 3 ) ! ! in (13), we have
1 k ! ( m = 1 ( 2 m 3 ) ! ! t m m ! ) k = n = k B n , k ( ( 1 ) ! ! , 1 ! ! , , ( 2 ( n k + 1 ) 3 ) ! ! ) t n n ! .
It is easy to check that the following Taylor series are complete
m = 1 ( 2 m 3 ) ! ! t m m ! = 1 1 2 t .
It follows from (14) and (15) that
B n , k ( ( 1 ) ! ! , 1 ! ! , , ( 2 ( n k + 1 ) 3 ) ! ! ) = 1 k ! n t n ( 1 1 2 t ) k | t = 0 .
Notice that for complex number α ,
( 1 + t ) α = n = 0 α n t n ,
which together with the binomial theorem gives
( 1 1 2 t ) k = j = 0 k k j ( 1 ) j ( 1 2 t ) j 2 = j = 0 k k j ( 1 ) j i = 0 j 2 i ( 2 ) i t i .
Hence, we get from (18) that
n t n ( 1 1 2 t ) k | t = 0 = ( 2 ) n n ! j = 0 k ( 1 ) j k j j 2 n .
Combing (16) and (19) gives
B n , k ( ( 1 ) ! ! , 1 ! ! , , ( 2 ( n k + 1 ) 3 ) ! ! ) = ( 2 ) n n ! k ! j = 0 k ( 1 ) j k j j 2 n .
It follows from (9), (10), (12) and (20) that
F ( n ) ( G ( t ) ) = ( 4 ) n n ! 2 m k = 0 n m + k 1 k 1 2 k j = 0 k ( 1 ) j k j j 2 n .
Thus, by equating (8) and (21), we complete of the proof of Theorem 1.
We here refer the interested reader to [19,20,21,22,23,24] for the special values and applications for the partial Bell polynomials. It is worth noticing that two equivalent versions of (20) have been obtained by Qi et al. ([21], Theorems 1 and 2). We rediscover (20) that stems from the following alternate proof of Theorem 1. □
The Second Proof of Theorem 1.
It is obvious from (17) and the binomial theorem that for positive integer m,
1 ( 1 + 1 4 t ) m = j = 0 m j ( 1 + 1 4 t 1 ) j = j = 0 m j i = 0 j j i ( 1 4 t 1 ) i .
Changing the order of the summations on the right side of (22) gives
1 ( 1 + 1 4 t ) m = i = 0 j = i m j j i ( 1 4 t 1 ) i .
Since 1 4 t 1 can be written as
1 4 t 1 = n = 1 g n t n ,
where g n is a sequence of numbers, ( 1 4 t 1 ) i is divisible by t i for non-negative integer i. It follows that for non-negative integer n,
n t n ( 1 ( 1 + 1 4 t ) m ) | t = 0 = n t n ( i = 0 n j = i m j j i ( 1 4 t 1 ) i ) | t = 0 = n t n ( i = 0 n j = i m j j i k = 0 i i k ( 1 ) i k ( 1 4 t ) k 2 ) | t = 0 = ( 4 ) n n ! i = 0 n j = i m j j i k = 0 i ( 1 ) i k i k k 2 n .
Observe that for non-negative integers i , j with j i ,
m j   =   ( 1 ) j m + j 1 j ,
and
m + j 1 j j i   =   m + i 1 i m + j 1 j i .
So from (25) and (26), we have
j = i m j j i = m + i 1 i j = i ( 1 ) j m + j 1 j i = ( 1 ) i m + i 1 i j = 0 ( 1 ) j m + j + i 1 j = ( 1 ) i m + i 1 i j = 0 m i j = ( 1 ) i m + i 1 i 1 2 m + i .
By putting (27) to the right side of (24), we obtain
n t n ( 1 ( 1 + 1 4 t ) m ) | t = 0 = ( 4 ) n n ! 2 m i = 0 n m + i 1 i 1 2 i k = 0 i ( 1 ) k i k k 2 n .
Thus, equating (8) and (28) gives
k 1 + + k m = n k 1 , , k m 0 C k 1 C k m = ( 4 ) n i = 0 n m + i 1 i 1 2 i k = 0 i ( 1 ) k i k k 2 n ,
as desired. This completes the proof of Theorem 1. □

3. The Proof of Theorem 2

It is easily seen that for positive integer n,
n t n ( 1 ( 1 + 1 4 t ) m + 1 ) = n 1 t n 1 { t ( 1 ( 1 + 1 4 t ) m + 1 ) } = n 1 t n 1 { m + 1 ( 1 + 1 4 t ) m t ( 1 1 + 1 4 t ) } .
It follows from (29) and the Leibniz rule that
n t n ( 1 ( 1 + 1 4 t ) m + 1 ) = ( m + 1 ) k = 0 n 1 n 1 k k + 1 t k + 1 ( 1 1 + 1 4 t ) × n 1 k t n 1 k ( 1 ( 1 + 1 4 t ) m ) = ( m + 1 ) k = 1 n n 1 k 1 k t k ( 1 1 + 1 4 t ) × n k t n k ( 1 ( 1 + 1 4 t ) m ) .
On the other hand, for positive integer n,
n t n ( 1 ( 1 + 1 4 t ) m + 1 ) = k = 0 n n k k t k ( 1 1 + 1 4 t ) n k t n k ( 1 ( 1 + 1 4 t ) m ) .
So from (30) and (31), we obtain that for positive integer n,
( m + 1 ) k = 1 n n 1 k 1 k t k ( 1 1 + 1 4 t ) n k t n k ( 1 ( 1 + 1 4 t ) m ) = k = 0 n n k k t k ( 1 1 + 1 4 t ) n k t n k ( 1 ( 1 + 1 4 t ) m ) .
It is obvious that (32) can be rewritten as
1 1 + 1 4 t n t n ( 1 ( 1 + 1 4 t ) m ) = ( m + 1 ) k = 1 n n 1 k 1 k t k ( 1 1 + 1 4 t ) n k t n k ( 1 ( 1 + 1 4 t ) m ) k = 1 n n k k t k ( 1 1 + 1 4 t ) n k t n k ( 1 ( 1 + 1 4 t ) m ) = k = 1 n n k ( k ( m + 1 ) n 1 ) k t k ( 1 1 + 1 4 t ) × n k t n k ( 1 ( 1 + 1 4 t ) m ) .
If we multiply both sides of (33) by 2 m and then take t = 0 , we have
n t n ( 2 m ( 1 + 1 4 t ) m ) | t = 0 = k = 1 n n k ( k ( m + 1 ) n 1 ) k t k ( 2 1 + 1 4 t ) | t = 0 × n k t n k ( 2 m ( 1 + 1 4 t ) m ) | t = 0 .
By applying (8) to both sides of (34), with the help of Theorem 1, we arrive at
k 1 + + k m = n k 1 , , k m 0 C k 1 C k m = k = 1 n ( k ( m + 1 ) n 1 ) C k k 1 + + k m = n k k 1 , , k m 0 C k 1 C k m = k = 1 n ( ( m + 1 ) ( n + 1 k ) n 1 ) C n + 1 k k 1 + + k m = k 1 k 1 , , k m 0 C k 1 C k m = k = 1 n ( ( m + 1 ) ( n + 1 k ) n 1 ) ( 4 ) k 1 C n + 1 k i = 0 k 1 m + i 1 i 1 2 i × j = 0 i ( 1 ) j i j j 2 k 1 .
This concludes the proof of Theorem 2.

4. Conclusions

In this paper, we have used some analytic and combinatorial methods to establish two new expressions for sums of products of arbitrary number of the Catalan numbers. One can be regarded as the closed formula for sums of products of arbitrary number of the Catalan numbers, and another is very analogous to the results shown in [16,17]. The methods presented here may be applied to explore the sum relations for some families of special polynomials, for example, Dickson polynomials, Laguerre polynomials, Hermite polynomials, and so on. However, it seems that it is difficult to establish some analogous expressions for sums of products of arbitrary number of the q-Bernoulli polynomials introduced in [25,26] and the q-Daehee polynomials considered in [27,28]. From what have been discussed in the second section, the studies on the above-mentioned polynomials probably enrich the topics on the special values of the partial Bell polynomials. This is left to the interested reader for further exploration.

Author Contributions

C.X. and Y.H. have equally contributed to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

We thank the anonymous referees for their valuable suggestions and further guidelines for this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Andrews, G.E. Catalan numbers, q-Catalan numbers and hypergeometric series. J. Combin. Theory Ser. A 1987, 44, 267–273. [Google Scholar] [CrossRef] [Green Version]
  2. Basic, B. On quotients of values of Euler’s function on the Catalan numbers. J. Number Theory 2016, 169, 160–173. [Google Scholar] [CrossRef]
  3. Hilton, P.; Pedersen, J. Catalan numbers, their generalization and their uses. Math. Intell. 1991, 13, 64–75. [Google Scholar] [CrossRef]
  4. Miana, P.J.; Romero, N. Moments of combinatorial and Catalan numbers. J. Number Theory 2010, 130, 1876–1887. [Google Scholar] [CrossRef] [Green Version]
  5. Stanley, R.P. Catalan Numbers; Cambridge University Press: New York, NY, USA, 2015. [Google Scholar]
  6. Mahmoud, M.; Qi, F. Three identities of the Catalan-Qi numbers. Mathematics 2016, 4, 35. [Google Scholar] [CrossRef]
  7. Touchard, J. Sur Certaines équations Fonctionnelles. In Proceedings of the International Mathematical Congress, Toronto, ON, Canada, 11–16 August 1924; Volume 1, pp. 465–472. [Google Scholar]
  8. Hilton, P.; Pedersen, J. The ballot problem and Catalan numbers. Nieuw Arch. Voor Wiskd. 1990, 8, 209–216. [Google Scholar]
  9. Koshy, T. Catalan Numbers with Applications; Oxford University Press: New York, NY, USA, 2009. [Google Scholar]
  10. Qi, F.; Cerone, P. Some properties of the Fuss-Catalan numbers. Mathematics 2018, 6, 277. [Google Scholar] [CrossRef] [Green Version]
  11. Kim, T.; Kim, D.S. Differential equations associated with Catalan-Daehee numbers and their applications. RACSAM 2017, 111, 1071–1081. [Google Scholar] [CrossRef]
  12. Kim, T.; Kwon, H.-I. Revisit symmetric identities for the λ-Catalan polynomials under the symmetry group of degree n. Proc. Jangjeon Math. Soc. 2016, 19, 711–716. [Google Scholar]
  13. Kim, T.; Kim, D.S. Some identities of Catalan-Daehee polynomials arising from umbral calculus. Appl.Comput. Math. 2017, 16, 177–189. [Google Scholar]
  14. Kim, D.S.; Kim, T. Triple symmetric identities for ω-Catalan polynomials. J. Korean Math. Soc. 2017, 54, 1243–1264. [Google Scholar]
  15. Qi, F.; Mahmoud, M.; Shi, X.T.; Liu, F.F. Some properties of the Catalan-Qi function related to the Catalan numbers. SpringerPlus 2016, 5, 1126. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  16. Zhang, W.; Chen, L. On the Catalan numbers and some of their identities. Symmetry 2019, 11, 62. [Google Scholar] [CrossRef] [Green Version]
  17. Zhang, J.; Chen, Z. A note on the sequence related to Catalan numbers. Symmetry 2019, 11, 371. [Google Scholar] [CrossRef] [Green Version]
  18. Comtet, L. Advanced Combinatorics, The Art of Finite and Infinite Expansions; Reidel Publishing: Dordrecht, The Netherlands, 1974. [Google Scholar]
  19. Howard, F.T. A special class of Bell polynomials. Math. Comput. 1980, 35, 977–989. [Google Scholar] [CrossRef]
  20. Qi, F.; Zheng, M.-M. Explicit expressions for a family of the Bell polynomials and applications. Appl. Math. Comput. 2015, 258, 597–607. [Google Scholar] [CrossRef] [Green Version]
  21. Qi, F.; Shi, X.T.; Liu, F.F.; Kruchinin, D.V. Several formulas for special values of the Bell polynomials of the second kind and applications. J. Appl. Anal. Comput. 2017, 7, 857–871. [Google Scholar]
  22. Qi, F.; Zhao, J.L. Some properties of the Bernoulli numbers of the second kind and their generating function. Bull. Korean Math. Soc. 2018, 55, 1909–1920. [Google Scholar]
  23. Qi, F.; Guo, B.-N. A diagonal recurrence relation for the Stirling numbers of the first kind. Appl. Anal. Discret. Math. 2018, 12, 153–165. [Google Scholar] [CrossRef] [Green Version]
  24. Qi, F.; Lim, D.; Guo, B.-N. Explicit formulas and identities for the Bell polynomials and a sequence of polynomials applied to differential equations. RACSAM 2019, 113, 1–9. [Google Scholar] [CrossRef]
  25. Carlitz, L. q-Bernoulli numbers and polynomials. Duke Math. J. 1948, 15, 987–1000. [Google Scholar] [CrossRef]
  26. Carlitz, L. q-Bernoulli and Eulerian numbers. Trans. Amer. Math. Soc. 1954, 76, 332–350. [Google Scholar]
  27. Araci, S.; Duran, U.; Acikgoz, M. On weighted q-Daehee polynomials with their applications. Indag. Math. 2019, 30, 365–374. [Google Scholar] [CrossRef]
  28. Lim, D. Some identities for Carlitz type q-Daehee polynomials. Ramanujan J. 2019, 50, 195–209. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Xie, C.; He, Y. New Expressions for Sums of Products of the Catalan Numbers. Axioms 2021, 10, 330. https://doi.org/10.3390/axioms10040330

AMA Style

Xie C, He Y. New Expressions for Sums of Products of the Catalan Numbers. Axioms. 2021; 10(4):330. https://doi.org/10.3390/axioms10040330

Chicago/Turabian Style

Xie, Conghui, and Yuan He. 2021. "New Expressions for Sums of Products of the Catalan Numbers" Axioms 10, no. 4: 330. https://doi.org/10.3390/axioms10040330

APA Style

Xie, C., & He, Y. (2021). New Expressions for Sums of Products of the Catalan Numbers. Axioms, 10(4), 330. https://doi.org/10.3390/axioms10040330

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop