English
Related papers

Related papers: Four transformations on the Catalan triangle

200 papers

A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…

Combinatorics · Mathematics 2018-07-27 Robert G. Donnelly , Molly W. Dunkum , Courtney George , Stefan Schnake

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Combinatorics · Mathematics 2010-12-20 Milan Janjic

Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…

Number Theory · Mathematics 2010-06-01 Zhi-Wei Sun

A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.

Classical Analysis and ODEs · Mathematics 2021-03-09 Wenchang Chu

The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.

Combinatorics · Mathematics 2020-12-04 Francesca Aicardi

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

Number Theory · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , R. J. Dolbin , Nathan Manning

Let $c=(C_n)_{n\ge 0}$ be the Catalan sequence and $T$ a linear and bounded operator on a Banach space $X$ such $4T$ is a power-bounded operator. The Catalan generating function is defined by the following Taylor series, $$…

Functional Analysis · Mathematics 2024-01-31 Pedro J. Miana , Natalia Romero

We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…

Combinatorics · Mathematics 2025-06-17 Boualam Rezig , Moussa Ahmia

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…

Combinatorics · Mathematics 2021-02-11 Paul E. Gunnells

In this paper, we present several novel integral representations of Catalan's constant. We begin by deriving an initial result expressed as a double integral. Subsequently, as a consequence of this result, we establish a general theorem…

Number Theory · Mathematics 2026-05-12 Emilio Gómez-Déniz , José María Sarabia

A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…

Combinatorics · Mathematics 2022-07-22 Yen-Jen Cheng , Sen-Peng Eu , Hsiang-Chun Hsu

Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help.…

Combinatorics · Mathematics 2021-06-15 Helmut Prodinger

We provide an explicit formulation for the solution to the Catalan's triangle system using Catalan's trapezoids and a specified boundary condition. Additionally, we study this system with various boundary conditions obtained by utilizing…

Combinatorics · Mathematics 2024-03-01 Yungang Lu

This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…

Number Theory · Mathematics 2018-04-24 Youngwoo Kwon

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an…

Combinatorics · Mathematics 2024-02-26 Francesca Aicardi

In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…

Combinatorics · Mathematics 2019-05-03 Johann Cigler

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun