Related papers: Some identities for the Catalan and Fine numbers
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…
We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…
Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…
We continue the study of the rational-slope generalized $q,t$-Catalan numbers $c_{m,n}(q,t)$. We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property…
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…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…
We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$.…
For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…
We prove that the Catalan Lie idempotent $D_n(a,b)$, introduced in [Menous {\it et al.}, Adv. Appl. Math. 51 (2013), 177] can be refined by introducing $n$ independent parameters $a_0,\ldots,a_{n-1}$ and that the coefficient of each…
In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*}…
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…
We introduce and study a generalization of the Narayana numbers $N_d(n,k) = \frac{1}{n+1} \binom{n+1}{k+1} \binom{ n + (n-k)(d-2)+1}{k}$ for integers $d \geq 2$ and $n,k \geq 0$. This two-parameter array extends the classical Narayana…
In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…
We introduce a transformation of finite integer sequences, show that every sequence eventually stabilizes under this transformation and that the number of fixed points is counted by the Catalan numbers. The sequences that are fixed are…
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…
In this paper we obtain a new curious identity involving trigonometric functions. Namely, for any positive odd integer $n$ we prove that $$\sum_{k=1}^n(-1)^k(\cot kx)\sin k(n-k)x=\frac{1-n}2,$$ which is equivalent to the identity…