Some identities on Catalan numbers and hypergeometric functions via Catalan matrix power

In this paper we use the Catalan matrix power as a tool for deriving identities involving Catalan numbers and hypergeometric functions. For that purpose, we extend earlier investigated relations between the Catalan matrix and the Pascal matrix by inserting the Catalan matrix power and particulary the squared Catalan matrix in those relations. We also pay attention to some relations between Catalan matrix powers of different degrees, which allows us to derive the simplification formula for hypergeometric function ₃F₂, as well as the simplification formula for the product of the Catalan number and the hypergeometric function ₃F₂. Some identities involving Catalan numbers, proved by the non-matrix approach, are also given.     

Moments on Catalan numbers

By combining inverse series relations with binomial convolutions and telescoping method, moments of Catalan numbers are evaluated, which resolves a problem recently proposed by Gutiérrez et al. [J.M. Gutiérrez, M.A. Hernández, P.J. Miana, N. Romero, New identities in the Catalan triangle, J. Math. Anal. Appl. 341 (1) (2008) 52-61].     

Identities involving Narayana polynomials and Catalan numbers

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give three different proofs for these identities, namely, two algebraic proofs and one combinatorial proof. Some applications are also given which lead to many known and new identities.     

Catalan matrix and related combinatorial identities

We introduce the notion of the Catalan matrix whose non-zero elements are expressions which contain the Catalan numbers arranged into a lower triangular Toeplitz matrix. Inverse of the Catalan matrix is derived. Correlations between the matrix and the generalized Pascal matrix are considered. Some combinatorial identities involving Catalan numbers, binomial coefficients and the generalized hypergeometric function are derived using these correlations. Moreover, an additional explicit representation of the Catalan number, as well as an explicit representation of the sum of the first m Catalan numbers are given.     

Analysis of the Bernstein basis functions: an approach to combinatorial sums involving binomial coefficients and Catalan numbers

We give some alternative forms of the generating functions for the Bernstein basis functions. Using these forms,we derive a collection of functional equations for the generating functions. By applying these equations, we prove some identities for the Bernstein basis functions. Integrating these identities, we derive a variety of identities and formulas, some old and some new, for combinatorial sums involving binomial coefficients, Pascal's rule, Vandermonde's type of convolution, the Bernoulli polynomials, and the Catalan numbers. Copyright © 2014 John Wiley & Sons, Ltd.     

Raney and Catalan

Raney’s lemma is often used in a counting argument to prove the formula for (generalized) Catalan numbers. It ensures the existence of “good” cyclic shifts of certain sequences, i.e. cyclic shifts for which all partial sums are positive.We introduce a simple algorithm that finds these cyclic shifts and also those with a slightly weaker property. Moreover it provides simple proofs of lemma’s of Raney type.A similar clustering procedure is also used in a simple proof of a theorem on probabilities of which many well-known results (e.g. on lattice paths and on generalized Catalan numbers) can be derived as corollaries. The theorem generalizes generalized Catalan numbers. In the end it turns out to be equivalent to a formula of Raney.     

Further identities on Catalan numbers

Three summation formulae on the $\lambda$-extended Catalan numbers are established by means of hypergeometric series approach with one of them being provided a combinatorial proof through lattice path countings.     

Some identities on the Catalan, Motzkin and Schröder numbers

In this paper, some identities between the Catalan, Motzkin and Schröder numbers are obtained by using the Riordan group. We also present two combinatorial proofs for an identity related to the Catalan numbers with the Motzkin numbers and an identity related to the Schröder numbers with the Motzkin numbers, respectively.     

New identities in the Catalan triangle

In this paper we prove new identities in the Catalan triangle whose (n,p) entry is defined by

     

Divisibility of generalized Catalan numbers

We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its power.     

A new statistic on Dyck paths for counting 3-dimensional Catalan words

A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path D, a recently defined statistic counts the number of Catalan words with the property that any subword on two letters is exactly D. In this paper, we enumerate Dyck paths with this statistic equal to certain values, including all primes. The formulas obtained are in terms of Motzkin numbers and Motzkin ballot numbers.     

Integral presentations of Catalan numbers

We compute in three different ways the same definite parametric integral. By-products are the derivation of a combinatorial identity and two integral presentations of Catalan numbers. One of them leads to a presentation using the γ function.     

Ballot matrix as Catalan matrix power and related identities

We use an analytical approach to find the kth power of the Catalan matrix. Precisely, it is proven that the power of the Catalan matrix is a lower triangular Toeplitz matrix which contains the well-known ballot numbers. A result from [H. S. Wilf, Generatingfunctionology, Academic Press, New York, 1990, Free download available from http://www.math.upenn.edu/~wilf/Downld.html.], related to the generating function for Catalan numbers, is extended to the negative integers. Three interesting representations for Catalan numbers by means of the binomial coefficients and the hypergeometric functions are obtained using relations between Catalan matrix powers.     

Catalan and Apéry numbers in residue classes

We estimate character sums with Catalan numbers and middle binomial coefficients modulo a prime p. We use this bound to show that the first at most p^13/2(logp)⁶ elements of each sequence already fall in all residue classes modulo every sufficiently large p, which improves the previously known result requiring p^O(p) elements. We also study, using a different technique, similar questions for sequences satisfying polynomial recurrence relations like the Apéry numbers. We show that such sequences form a finite additive basis modulo p for every sufficiently large prime p.     

明安图与Catalan数

中国数学家明安图在其《割圜密率捷法》中最先应用了Catalan数,取得优秀的研究成果.本文简介明安图的计数成就和Catalan数,综述国内外对明安图应用该数的研究.特别地,近两年来英国的Larcombe发表了5篇文章,对明安图的成果——包含Catalan数的sin（2pa）展开式,加以推广,并给出明安图确定Catalan 数的第二种方法的严格代数证明.     

Proofs of two conjectures on Catalan triangle numbers

We prove two conjectures on sums of products of Catalan triangle numbers, which were originally conjectured by Miana et al. [Discrete Math. 340 (2017), 2388–2397]. The first one is proved by using Zeilberger's algorithm, and the second one is proved by establishing its q-analogue.     

Sequences of Ordered Sets and Catalan Numbers

We define the down sets (lower covers, respectively) sequence of an ordered set. We show that the number of down set sequences of an n-ordered set is equal to the n-th Catalan Number. We give a characterization of down sets sequences of an ordered set and another characterization of lower covers sequences of an ordered set.     

Knight's paths towards Catalan numbers

We provide enumerating results for partial knight's paths of a given size. We prove algebraically that zigzag knight's paths of a given size ending on the x-axis are enumerated by the generalized Catalan numbers, and we give a constructive bijection with peakless Motzkin paths of a given length. After enumerating partial knight's paths of a given length, we prove that zigzag knight's paths of a given length ending on the x-axis are counted by the Catalan numbers. Finally, we give a constructive bijection with Dyck paths of a given length.     

Generalized harmonic numbers,Jacobi numbers and a Hankel determinant evaluation

In this paper we will introduce a sequence of complex numbers that are called the Jacobi numbers. This sequence generalizes in a natural way several sequences that are known in the literature, such as Catalan numbers, central binomial numbers, generalized catalan numbers, the coefficient of the Hilbert matrix and others. Subsequently, using a study of the polynomial of Jacobi, we give an evaluation of the Hankel determinants that associated with the sequence of Jacobi numbers. Finally, by finding a relationship between the Jacobi numbers and generalized harmonic numbers, we determine the evaluation of the Hankel determinants that are associated with generalized harmonic numbers.