Previous Article in Journal
Change Point Detection with Mean Shift Based on AUC from Symmetric Sliding Windows
Previous Article in Special Issue
The Quadratic Residues and Some of Their New Distribution Properties

Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

# Euler–Catalan’s Number Triangle and Its Application

by
Yuriy Shablya
* and
Dmitry Kruchinin
Department of Complex Information Security of Computer Systems, Tomsk State University of Control Systems and Radioelectronics, Tomsk 634050, Russia
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(4), 600; https://doi.org/10.3390/sym12040600
Submission received: 10 March 2020 / Revised: 29 March 2020 / Accepted: 30 March 2020 / Published: 10 April 2020

## Abstract

:
In this paper, we study such combinatorial objects as labeled binary trees of size n with m ascents on the left branch and labeled Dyck n-paths with m ascents on return steps. For these combinatorial objects, we present the relation of the generated number triangle to Catalan’s and Euler’s triangles. On the basis of properties of Catalan’s and Euler’s triangles, we obtain an explicit formula that counts the total number of such combinatorial objects and a bivariate generating function. Combining the properties of these two number triangles allows us to obtain different combinatorial objects that may have a symmetry, for example, in their form or in their formulas.
MSC:
11Y55; 05A15; 05C05

## 1. Introduction

Combinatorial objects such as permutations, combinations, partitions, graphs, trees, paths, etc. play an important role in mathematics and computer science and also have many applications in practice. Knuth [1] gave an overview of the formation and development of the direction related to designing combinatorial algorithms. In this field of mathematics, the following tasks are distinguished: enumerating, listing, and generating combinatorial objects.
Sometimes combinatorial sets can be described by using number triangles, for example, for their enumerating (in this case, an element $T n , m$ of a number triangle shows the total number of objects in the corresponding combinatorial set $A n , m$, i.e., $T n , m = | A n , m |$ where $| A n , m |$ is the cardinality of the combinatorial set $A n , m$). A number triangle is a doubly-indexed sequence in which the length of each row corresponds to the index of the row. There are many well-known number triangles such as Pascal’s triangle, Catalan’s triangle, Euler’s triangles, Stirling’s triangles, Narayana’s triangle, etc., whose elements have a whole set of combinatorial interpretations [2].
To define a number triangle, it is necessary to specify the rules for generating elements $T n , m$ of this triangle. For example, it can be some expression for $T n , m$ in the form of an explicit formula or a recurrence relation. It can also be an expression of a bivariate generating function:
$T ( x , y ) = ∑ n ∑ m T n , m x n y m .$
Generating functions are a powerful tool for solving problems in many fields of mathematics and they can also be applied for studying combinatorial sets, especially for their enumeration. Some examples of using generating functions for solving this problem can be found in [3,4,5,6,7]. In addition, describing the properties of combinatorial objects with the help of generating functions, it is often possible to find a relationship with special numbers [8,9,10,11,12].
In this paper, we study labeled binary trees with ascents on the left branch and labeled Dyck paths with ascents on return steps. For these combinatorial objects, we obtain an explicit formula that counts the total number of such objects and a bivariate generating function. In addition, we present the relation of the obtained number triangle to Catalan’s and Euler’s triangles and call the obtained number triangle as Euler–Catalan’s triangle and the elements of this triangle as the Euler–Catalan numbers.

## 2. Combinatorial Objects

Binary trees are widely used in many different topics of discrete mathematics. They allow us to represent objects with a hierarchical structure in a convenient form for their storage and processing. Depending on the set of parameters and characteristics that describe the structural features of the binary tree, the class of binary trees is divided into many subclasses. Therefore, a large number of different combinatorial sets can be distinguished. There are also many different kinds of problems related to trees, for example, their enumeration or algorithmic problems that are discoursed in [13].
Let us consider the following combinatorial object: a labeled binary tree of size n with m ascents on the left branch. In such a tree structure, a tree consists of n nodes, each node has at most two children (the left child and the right child), and each node has its own label (a unique value from 1 to n) [14]. By the left branch of a tree, we mean the tree obtained by removing all right children (the identifier St000061 in [15]). If we consider the sequence of labels of the left branch of a tree starting from the root, then it has exactly m ascents (that is, there are exactly m labels that are greater than the previous).
Figure 1 shows all possible variants of such labeled trees for $n = 3$ and $m = 1$. For the left branch of a tree, every pair of labels that form an ascent is marked with a green edge and every pair of labels that form a descent is marked with a red edge.
The following combinatorial object has the same properties: a labeled Dyck n-path with m ascents on return steps. In such a Dyck n-path, each down-step has its own label (a unique value from 1 to n). If we consider the sequence of labels of down-steps of a Dyck n-path starting from $( 0 , 0 )$, then it has exactly m ascents (that is, there are exactly m labels that are greater than the previous).
A Dyck n-path is a lattice path in the plane which begins at $( 0 , 0 )$, ends at $( 2 n , 0 )$, and consists of steps $( 1 , 1 )$ called rises or up-steps and $( 1 , − 1 )$ called falls or down-steps. A return step is a down-step at level 1 (a return to the ground level 0) [16]. There are many research papers dedicated to studying Dyck paths. For example, it can be: the enumeration of Dyck paths and the study of their statistics [16,17,18], the study of different generalizations [19,20,21,22], the generation of Dyck paths, their ranking and unranking [23,24], and many other tasks.
Figure 2 shows all possible variants of the considered labeled Dyck paths for $n = 3$ and $m = 1$.
The presented combinatorial objects have similar properties related to their structure and it is possible to define a bijection between them. We can also define other combinatorial objects that have similar properties. To do this, we need to consider such unlabeled combinatorial objects for which the number of objects is defined by the elements of the transposed Catalan triangle (the sequence $A 033184$ in OEIS [25]).Then, we need to get the labeled version of such objects.
The connection of the transposed Catalan triangle with the Catalan numbers allows us to obtain a variety of combinatorial interpretations for the elements of this number triangle. It is possible because Catalan numbers are used in many combinatorial problems and there are more than 200 known combinatorial interpretations for them [26,27].
The Catalan numbers form the following sequence of positive integers (the sequence $A 000108$ in OEIS [25]):
$1 , 1 , 2 , 5 , 14 , 42 , 132 , 429 , 1430 , 4862 , 16796 , 58786 , 208012 , …$
The Catalan numbers are denoted as $C n$. According to Graham et al. [2], an explicit formula for $n ≥ 0$ is
$C n = 1 n + 1 2 n n$
and an ordinary generating function is
$C ( x ) = ∑ n > 0 C n − 1 x n = 1 − 1 − 4 x 2 .$
The Catalan numbers also satisfy the following recurrence relation:
$C n = ∑ i = 0 n − 1 C i C n − i − 1 , C 0 = 1 .$
In addition, there are many different generalizations of the Catalan numbers that associate them with other special numbers. For example, it could be numbers such as the Catalan–Mersenne numbers [28], the Eulerian–Catalan numbers [29], the Catalan–Daehee numbers [30,31,32], etc.

## 3. Main Results

For the presented combinatorial objects, we have obtained an explicit formula for their enumerating. However, to state the theorem, it is necessary to consider the description of the following number triangles: the transposed Catalan triangle, Euler’s triangle, and the number of m-permutations of n.
The elements of the transposed Catalan triangle (the sequence $A 033184$ in OEIS [25]) are denoted as $C n , m$. According to Deutsch [16], an explicit formula for $1 ≤ m ≤ n$ is
$C n , m = m n 2 n − m − 1 n − 1 .$
Table 1 presents several first values of the transposed Catalan triangle.
The elements of Euler’s triangle (the sequence $A 173018$ in OEIS [25]) are denoted as $E n , m$. The elements $E n , m$ of Euler’s triangle are also called the Eulerian numbers of the first kind [33]. According to Graham et al. [2], an explicit formula for $0 ≤ m ≤ n$ is
$E n , m = ∑ k = 0 m ( − 1 ) k ( m − k + 1 ) n n + 1 k .$
Table 2 presents several first values of Euler’s triangle.
The numbers of the m-permutations of n [34] form the number triangle (the sequence $A 008279$ in OEIS [25]) that elements are denoted as $P n , m$. According to Graham et al. [2], an explicit formula for $0 ≤ m ≤ n$ is
$P n , m = n ! ( n − m ) ! .$
Table 3 presents several first values of this number triangle.
Theorem 1.
The number of labeled binary trees of size n with m ascents on the left branch is
$E C n , m = 1 , f o r n = m = 0 ; ∑ k = m + 1 n C n , k E k , m P n , n − k , o t h e r w i s e ,$
where $C n , m$ is the transposed Catalan triangle, $E n , m$ is Euler’s triangle, and $P n , m$ is the number of m-permutations of n.
Proof.
The number of binary trees of size n with m nodes on the left branch is defined by the elements of the transposed Catalan triangle $C n , m$ (the sequence $A 173018$ in OEIS [25]). Then, we consider a labeled version of these binary trees (for each node, there is an associated unique value from 1 to n). We need to count the number of ways to label the given binary tree of size n with k nodes on the left branch such that it has exactly m ascents on the left branch. For this, it is necessary that the labels of k nodes on the left branch form a permutation of k elements with m ascents and the remaining labels of $n − k$ nodes form all possible permutations.
An ascent of a permutation $π 1 π 2 … π n$ of ${ 1 , 2 , … , n }$ is a place where $π i < π i + 1$ [2,35]. The number of permutations of n elements with m ascents is defined by the elements of Euler’s triangle $E n , m$ (the sequence $A 173018$ in OEIS [25]). The number of permutations of m elements given from a set of n elements is defined by $P n , m$ (the sequence $A 008279$ in OEIS [25]). Hence, combining Equations (1) and (2), we get the number of ways to label the given binary tree of size n with k nodes on the left branch such that it has exactly m ascents on the left branch
$E k , m P n , n − k .$
If we consider all variants of binary trees of size n with k nodes on the left branch for k from $m + 1$ to n (since $E k , m = 0$ for $k ≤ m$) and get the number of ways to label them using Equation (4), we obtain the total number of labeled binary trees of size n with m ascents on the left branch
$∑ k = m + 1 n C n , k E k , m P n , n − k .$
We also need to consider a special case for $n = m = 0$ when $E C 0 , 0 = 1$. This means that there is only one variant to get a labeled binary tree of size 0 without ascents on the left branch (an empty labeled binary tree).
Hence, we obtain the desired result in Equation (3). □
It is known that the number of Dyck n-paths with m return steps is also defined by the elements of the transposed Catalan triangle [16]. If we consider labeled version of Dyck n-paths with k return steps (for each down-step there is an associated unique value from 1 to n) with m ascents on return steps, then we can get the same result:
Corollary 1.
The number of labeled Dyck n-paths with m ascents on return steps is
$E C n , m = 1 , f o r n = m = 0 ; ∑ k = m + 1 n C n , k E k , m P n , n − k , o t h e r w i s e ,$
where $C n , m$ is the transposed Catalan triangle, $E n , m$ is Euler’s triangle, and $P n , m$ is the number of m-permutations of n.
Proof.
The proof of Corollary 1 is the same as for Theorem 1: we need to count the number of ways to label the given Dyck n-path with k return steps such that the labels of k return steps form a permutation of k elements with m ascents and the remaining labels of $n − k$ return steps form all possible permutations. □
The sequence of $E C n , m$ forms a number triangle (see Table 4). Due to the connection with Catalan’s and Euler’s triangles, let us call it Euler–Catalan’s triangle. The elements $E C n , m$ of Euler–Catalan’s triangle are here called the Euler–Catalan numbers.
The next step in studying the introduced number triangle is to obtain an expression for the generating function of the Euler–Catalan numbers.
Theorem 2.
The Euler–Catalan numbers $E C n , m$ are defined by the following bivariate generating function:
$E C ( x , y ) = ∑ n ≥ 0 ∑ m ≥ 0 E C n , m n ! x n y m = y − 1 y − e C ( x ) ( y − 1 ) ,$
where $C ( x ) = 1 − 1 − 4 x 2$ is the generating function of the Catalan numbers.
Proof.
Let us consider $E C ( x , y )$ as the composition of generating functions
$E C ( x , y ) = E C ( x ) , y ,$
where
$E ( x , y ) = ∑ n ≥ 0 ∑ m ≥ 0 E n , m n ! x n y m = y − 1 y − e x ( y − 1 )$
is the bivariate generating function of Euler’s triangle [2].
According to Kruchinin and Kruchinin [36], if we have the composition
$A ( x ) = R ( F ( x ) ) = ∑ n ≥ 0 a n x n$
of generating functions $R ( x ) = ∑ n ≥ 0 r n x n$ and $F ( x ) = ∑ n > 0 f n x n$, then we can obtain the values of the coefficient function
$a n = r 0 , for n = 0 ; ∑ k = 1 n F Δ ( n , k ) r k , otherwise ,$
where $F Δ ( n , k )$ is the composita of the generating function $F ( x )$:
$F ( x ) k = ∑ n ≥ k F Δ ( n , k ) x n .$
The composita of $C ( x ) = 1 − 1 − 4 x 2$ is [37]
$C Δ ( n , k ) = k n 2 n − k − 1 n − 1 = C n , k .$
Using Equation (6) for the composition $A ( x ) = E C ( x , y ) = E ( C ( x ) , y )$, we get
$a n = 1 , for n = 0 ; ∑ k = 1 n C Δ ( n , k ) ∑ m ≥ 0 E k , m k ! y m , otherwise , = 1 , for n = 0 ; ∑ m ≥ 0 y m 1 n ! ∑ k = m + 1 n C n , k E k , m P n , n − k , otherwise , = 1 , for n = 0 ; ∑ m ≥ 0 y m E C n , m n ! , otherwise .$
Hence, we obtain the desired result in Equation (5). □

## 4. Conclusions

In this paper, we study labeled binary trees of size n with m ascents on the left branch and labeled Dyck n-paths with m ascents on return steps. Using properties of Catalan’s and Euler’s number triangles, we obtain the explicit formula that counts the total number of such combinatorial objects. The obtained results can be generalized for enumerating many other combinatorial sets that are also related to labeled versions of combinatorial interpretations for the transposed Catalan triangle.
In addition, for these combinatorial objects, we derive the bivariate generating function. Information about the generating function that describes a combinatorial set can be applied for a more detailed study of the properties of the combinatorial set.

## Author Contributions

Investigation, Y.S. and D.K.; writing—original draft preparation, Y.S.; and writing—review and editing, D.K. All authors have read and agreed to the published version of the manuscript.

## Funding

Obtaining the explicit formula was funded by the Russian Foundation for Basic Research (the research project No. 18-31-00201). Obtaining the bivariate generating function was supported by the Russian Science Foundation (the research project No. 18-71-00059).

## Acknowledgments

The authors would like to thank the referees for their helpful comments and suggestions.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Knuth, D.E. The Art of Computer Programming, Volume 4A: Combinatorial Algorithms; Addison-Wesley: Boston, MA, USA, 2011. [Google Scholar]
2. Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics; Addison-Wesley: Boston, MA, USA, 1994. [Google Scholar]
3. Banderier, C.; Bousquet-Melou, M.; Denise, A.; Flajolet, P.; Gardy, D.; Gouyou-Beauchamps, D. Generating functions for generating trees. Discret. Math. 2002, 246, 29–55. [Google Scholar] [CrossRef] [Green Version]
4. Mansour, T.; Shattuck, M.; Wagner, S. Enumerating set partitions by the number of positions between adjacent occurrences of a letter. Appl. Anal. Discret. Math. 2010, 4, 284–308. [Google Scholar]
5. Drmota, M. Embedded trees and the support of the ISE. Eur. J. Combin. 2013, 34, 123–137. [Google Scholar] [CrossRef] [PubMed] [Green Version]
6. Srivastava, H.M.; Chaudhary, M.P. Some relationships between g-product identities, combinatorial partition identities and continued-fraction identities. Adv. Stud. Contemp. Math. 2015, 25, 265–272. [Google Scholar]
7. Mansour, T.; Shattuck, M. New refined enumerations of set partitions related to sorting. J. Differ. Equ. Appl. 2018, 24, 1588–1603. [Google Scholar] [CrossRef]
8. Bayad, A.; Simsek, Y.; Srivastava, H.M. Some array type polynomials associated with special numbers and polynomials. Appl. Math. Comput. 2014, 244, 149–157. [Google Scholar] [CrossRef]
9. Cakic, N.P.; El-Desouky, B.S.; Milovanovic, G.V. Explicit formulas and combinatorial identities for generalized Stirling numbers. Mediterr. J. Math. 2013, 10, 57–72. [Google Scholar] [CrossRef]
10. Gould, H.W. A new symmetrical combinatorial ldentity. J. Combin. Theory Ser. A 1972, 13, 278–286. [Google Scholar] [CrossRef] [Green Version]
11. Mansour, T.; Shattuck, M. A generalized class of restricted Stirling and Lah numbers. Math. Slovaca 2018, 68, 727–740. [Google Scholar] [CrossRef]
12. Simsek, Y. New families of special numbers for computing negative order Euler numbers and related numbers and polynomials. Appl. Anal. Discret. Math. 2018, 12, 1–35. [Google Scholar] [CrossRef]
13. Belov, A.Y. Linear recurrence equations on a tree. Math. Notes 2005, 78, 603–609. [Google Scholar] [CrossRef]
14. Gessel, I.M.; Griffin, S.T.; Tewari, V. Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity. Adv. Math. 2019, 356, 1–67. [Google Scholar] [CrossRef] [Green Version]
15. Rubey, M.; Stump, C. FindStat—The combinatorial statistics database. Available online: http://www.findstat.org (accessed on 1 March 2020).
16. Deutsch, E. Dyck path enumeration. Discret. Math. 1999, 204, 167–202. [Google Scholar] [CrossRef] [Green Version]
17. Banderier, C.; Krattenthaler, C.; Krinik, A.; Kruchinin, D.; Kruchinin, V.; Nguyen, D.; Wallner, M. Explicit formulas for enumeration of lattice paths: Basketball and the kernel method. In Lattice Path Combinatorics and Applications; Springer: Cham, Switzerland, 2019; Volume 58, pp. 78–118. [Google Scholar]
18. Sapounakis, A.; Tasoulas, I.; Tsikouras, P. Dyck path statistics. WSEAS Trans. Math. 2006, 5, 459–464. [Google Scholar]
19. Labelle, J.; Yeh, Y.N. Generalized Dyck paths. Discret. Math. 1990, 82, 1–6. [Google Scholar] [CrossRef] [Green Version]
20. Rukavicka, J. On generalized Dyck paths. Electron. J. Combin. 2011, 18, 1–3. [Google Scholar] [CrossRef] [Green Version]
21. Cameron, N.T.; McLeod, J.E. Returns and hills on generalized Dyck paths. J. Integer Seq. 2016, 19, 1–28. [Google Scholar]
22. Xu, R.; Yeh, Y.N.; Zhu, X. List colouring of graphs and generalized Dyck paths. Discret. Math. 2018, 341, 810–819. [Google Scholar] [CrossRef] [Green Version]
23. Penaud, J.G.; Roques, O. Génération de chemins de Dyck à pics croissants. Discret. Math. 2002, 246, 255–267. [Google Scholar] [CrossRef] [Green Version]
24. Manes, K.; Sapounakis, A.; Tasoulas, I.; Tsikouras, P. Recursive generation of k-ary trees. J. Integer Seq 2009, 12, 1–18. [Google Scholar]
25. Sloane, N.J.A. The on-line encyclopedia of integer sequences. Available online: http://oeis.org (accessed on 1 March 2020).
26. Stanley, R.P. Catalan Numbers; Cambridge University Press: New York, NY, USA, 2015. [Google Scholar]
27. Kim, D.S.; Kim, T. A new approach to Catalan numbers using differential equations. Russ. J. Math. Phys. 2017, 24, 465–475. [Google Scholar] [CrossRef] [Green Version]
28. Eum, I.S. A congruence relation of the Catalan–Mersenne numbers. Indian J. Pure Appl. Math. 2018, 49, 521–526. [Google Scholar] [CrossRef]
29. Bidkhori, H.; Sullivant, S. Eulerian–Catalan numbers. Electron. J. Combin. 2011, 18, 1–10. [Google Scholar] [CrossRef]
30. Kim, T.; Kim, D.S. Some identities of Catalan-Daehee polynomials arising from umbral calculus. Appl. Comput. Math. 2017, 16, 177–189. [Google Scholar]
31. Kim, T.; Kim, D.S. Differential equations associated with Catalan-Daehee numbers and their applications. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. RACSAM 2017, 111, 1071–1081. [Google Scholar] [CrossRef]
32. Dolgy, D.V.; Jang, G.W.; Kim, D.S.; Kim, T. Explicit expressions for Catalan-Daehee numbers. Proc. Jangjeon Math. Soc. 2017, 20, 1–9. [Google Scholar]
33. Mariconda, C.; Tonolo, A. Stirling numbers and Eulerian numbers. In Discrete Calculus; Springer: Cham, Switzerland, 2016; pp. 105–151. [Google Scholar]
34. Chen, B.F.; Ghorbani, E.; Wong, K.B. Cyclic decomposition of k-permutations and eigenvalues of the arrangement graphs. Electron. J. Combin. 2013, 20, 1–18. [Google Scholar] [CrossRef] [Green Version]
35. Tanimoto, S. An operator on permutations and its application to Eulerian numbers. Eur. J. Combin. 2001, 22, 569–576. [Google Scholar] [CrossRef] [Green Version]
36. Kruchinin, V.V.; Kruchinin, D.V. Composita and its properties. J. Anal. Number Theory 2014, 2, 37–44. [Google Scholar]
37. Kruchinin, D.V.; Kruchinin, V.V. A method for obtaining generating functions for central coefficients of triangles. J. Integer Seq. 2012, 15, 1–10. [Google Scholar]
Figure 1. All labeled binary trees of size 3 with 1 ascent on the left branch.
Figure 1. All labeled binary trees of size 3 with 1 ascent on the left branch.
Figure 2. All labeled Dyck paths of size 3 with 1 ascent on return steps.
Figure 2. All labeled Dyck paths of size 3 with 1 ascent on return steps.
Table 1. Several first values of the transposed Catalan triangle.
Table 1. Several first values of the transposed Catalan triangle.
$n ∖ m$12345678910
11
211
3221
45531
51414941
64242281451
713213290482061
8429429297165752771
91430143010015722751103581
10486248623432200210014291544491
Table 2. Several first values of Euler’s triangle.
Table 2. Several first values of Euler’s triangle.
$n ∖ m$0123456789
01
110
2110
31410
41111110
5126662610
61573023025710
7112011912416119112010
81247429315,61915,619429324710
9150214,60888,234156,19088,23414,60850210
Table 3. Several first values of $P n , m$.
Table 3. Several first values of $P n , m$.
$n ∖ m$0123456789
01
111
2122
31366
414122424
5152060120120
61630120360720720
71742210840252050405040
818563361680672020,16040,32040,320
91972504302415,12060,480181,440362,880362,880
Table 4. Several first values of Euler–Catalan’s triangle.
Table 4. Several first values of Euler–Catalan’s triangle.
$n ∖ m$012345678
01
110
2310
3191010
41931192310
5272118064664610
649,17134,01710,26215028710
71,084,483770,274255,79547,020442516210
828,245,72920,429,5517,235,8531,539,939193,69912,52530310

## Share and Cite

MDPI and ACS Style

Shablya, Y.; Kruchinin, D. Euler–Catalan’s Number Triangle and Its Application. Symmetry 2020, 12, 600. https://doi.org/10.3390/sym12040600

AMA Style

Shablya Y, Kruchinin D. Euler–Catalan’s Number Triangle and Its Application. Symmetry. 2020; 12(4):600. https://doi.org/10.3390/sym12040600

Chicago/Turabian Style

Shablya, Yuriy, and Dmitry Kruchinin. 2020. "Euler–Catalan’s Number Triangle and Its Application" Symmetry 12, no. 4: 600. https://doi.org/10.3390/sym12040600

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

Back to TopTop