2000 character limit reached
Four transformations on the Catalan triangle
Published 9 May 2013 in math.CO | (1305.2017v1)
Abstract: In this paper, we define four transformations on the classical Catalan triangle $\mathcal{C}=(C_{n,k}){n\geq k\geq 0}$ with $C{n,k}=\frac{k+1}{n+1}\binom{2n-k}{n}$. The first three ones are based on the determinant and the forth is utilizing the permanent of a square matrix. It not only produces many known and new identities involving Catalan numbers, but also provides a new viewpoint on combinatorial triangles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.