• Communications of the Korean Mathematical Society
• /
• v.23 no.3
• /
• pp.349-356
• /
• 2008

In this paper, we generalize the Catalan number to the (n, k)-th Catalan numbers and find a combinatorial description that the (n, k)-th Catalan numbers is equal to the number of partitions of n(k-1)+2 polygon by (k+1)-gon where all vertices of all (k+1)-gons lie on the vertices of n(k-1)+2 polygon.

• Communications of the Korean Mathematical Society
• /
• v.28 no.4
• /
• pp.827-832
• /
• 2013

In this paper we apply the Catalan transform to the ${\kappa}$-Fibonacci sequence finding different integer sequences, some of which are indexed in OEIS and others not. After we apply the Hankel transform to the Catalan transform of the ${\kappa}$-Fibonacci sequence and obtain an unusual property.

• East Asian mathematical journal
• /
• v.39 no.1
• /
• pp.23-27
• /
• 2023

In this paper, we derive the some identities which are related to the multifactorial numbers and the Catalan numbers. We utilize the fundamental theorem of Riordan matrix to obtain those identities.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.649-658
• /
• 2019

In this paper, we prove some congruences involving the generalized Catalan numbers and harmonic numbers modulo $p^2$, one of which is $$\sum\limits_{k=1}^{p-1}k^2B_{p,k}B_{p,k-d}{\equiv}4(-1)^d\{{\frac{1}{3}}d(2d^2+1)(4pH_d-1)-p\({\frac{26}{9}}d^3+{\frac{4}{3}}d^2+{\frac{7}{9}}d+{\frac{1}{2}}\)\}\;(mod\;p^2)$$, where a prime number p > 3 and $1{\leq}d{\leq}p$.

• Journal of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.187-199
• /
• 2016

The r-ary number sequences given by $$(b^{(r)}_n)_{n{\geq}0}=\Large{\frac{1}{(r-1)n+1}}(^{rn}_n)$$ are analogs of the sequence of the Catalan numbers ${\frac{1}{n+1}}(^{2n}_n)$. Their history goes back at least to Lambert [8] in 1758 and they are of considerable interest in sequential testing. Usually, the sequences are considered separately and the generalizations can go in several directions. Here we link the various r first by introducing a new combinatorial structure related to GR trees and then algebraically as well. This GR transition generalizes to give r-ary analogs of many sequences of combinatorial interest. It also lets us find infinite numbers of combinatorially defined sequences that lie between the Catalan numbers and the Ternary numbers, or more generally, between $b^{(r)}_n$ and $b^{(r+1)}_n$.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1079-1095
• /
• 2021

In this paper, we give new congruences with the generalized Catalan numbers and harmonic numbers modulo p². One of our results is as follows: for prime number p > 3, $${\sum\limits_{k=(p+1)/2}^{p-1}}\;k^2B_{p,k}B_{p,k-(p-1)/2}H_k{\equiv}(-1)^{(p-1)/2}\(-{\frac{521}{36}}p-{\frac{1}{p}}-{\frac{41}{12}}+pH^2_{3(p-1)/2}-10pq^2_p(2)+4\({\frac{10}{3}}p+1\)q_p(2)\)\;(mod\;p^2),$$ where q_p(2) is Fermat quotient.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.12
• /
• pp.226-231
• /
• 2016

Binomial trees are used to price barrier options. Since barrier options are path dependent, option values of each node are calculated from binomial trees using backward induction. We use generalized Catalan numbers to determine the number of cases not reaching a barrier. We will generalize Catalan numbers by imposing upper and lower bounds. Reaching a barrier in binomial trees is determined by the difference between the number of up states and down states. If we count the cases that the differences between the up states and down states remain in a specific range, the probability of not reaching a barrier is obtained at a final node of the tree. With probabilities and option values at the final nodes of the tree, option prices are computable by discounting the expected option value at expiry. Without calculating option values in the middle nodes of binomial trees, option prices are computable only with final option values. We can obtain a probability distribution of exercising an option at expiry. Generalized Catalan numbers are expected to be applicable in many other areas.

• Cross-Cultural Studies
• /
• v.50
• /
• pp.225-259
• /
• 2018

In this study, according to the Institut d'Estudis Catalan, it is noted that the traditional Catalan time telling system is essentially based on delineating time by the use of the 'quarts (=quarters)' of an hour. In this fasion, to tell the time 8:15, 8:30 and 8:45 they use '${\acute{E}}s$ un quart de nou.,' '$S{\acute{o}}n$ dos quarts de nou.,' and '$S{\acute{o}}n$ tres quarts de nou.,' but do not use constructions such as '$S{\acute{o}}n$ les vuit i quinze.,' '$S{\acute{o}}n$ les vuit i trenta/mitja.,' '$S{\acute{o}}n$ les vuit i quaranta-cinc.,' because these expressions are considered to be as dialectal variants or international notation-based variants. Moreover, the traditional Catalan time telling system does not use cardinal numbers, except in the case of 'cinc (five)' and 'deu (ten).' These linguistic phenomenon cause the invention of a unique Catalan digital watch, and has noted special designs for the creation of a Catalan analogue watch. For this reason, the quarter system in colloquial Catalan provokes an enormous interpretative ambiguity in daily routine expressions with 'quarts' like '$S{\acute{o}}n$ quarts of nou.' or 'entre dos i tres quarts' whose meaning is not delineated between sixteen and forty-four minutes. We will argue that the traditional Catalan time telling expressions do not have the use of the subtractive system, and the fraction word 'quart' lacks a specific meaning of fifteen minutes because the Catalan word 'quart' is etymologically related to the classical public bell system, not definitively to the traditional clock system.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.1-16
• /
• 2016

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.