Related papers: Catalan numbers and relations
We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
In this paper, we investigate the weighted Catalan, Motzkin and Schr\"oder numbers together with the corresponding weighted paths. The relation between these numbers is illustrated by three equations, which also lead to some known and new…
If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…
We analyze both finite and infinite systems of Riccati equations derived from stochastic differential games on infinite networks. We discuss a connection to the Catalan numbers and the convergence of the Catalan functions by Fourier…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
This note provide bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R.…
By prepending zeros to a given sequence Hankel determinants of backward shifts of this sequence become meaningful. We obtain some results for the sequences of Catalan numbers and of some numbers and polynomials which are related to Catalan…
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
We will look at the Catalan numbers from the {\it Rigged Configurations} point of view originated \cite{Kir} from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our…
We study a family of sequences $c_n(a_2,\ldots,a_r)$, where $r\ge2$ and $a_2,\ldots,a_r$ are real parameters. We find a sufficient condition for positive definiteness of the sequence $c_n(a_2,\ldots,a_r)$ and check several examples from…
In type A, the q,t-Fuss-Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group. We generalize this construction to (finite) complex reflection groups and, based on computer experiments, we…
Based on a $q$-congruence of the author and Petrov, we set up a $q$-analogue of Sun--Tauraso's congruence for sums of Catalan numbers, which extends a $q$-congruence due to Tauraso.
We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.
Let $I$ be the ideal generated by alternating polynomials in two sets of $n$ variables. Haiman proved that the $q,t$-Catalan number is the Hilbert series of the graded vector space $M(=\bigoplus_{d_1,d_2}M_{d_1,d_2})$ spanned by a minimal…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…
Let $B$ and $R$ be two simple graphs with vertex set $V$, and let $G(B,R)$ be the simple graph with vertex set $V$, in which two vertices are adjacent if they are adjacent in at least one of $B$ and $R$. For $X \subseteq V$, we denote by…
In the context of learning formal languages, data about an unknown target language L is given in terms of a set of (word,label) pairs, where a binary label indicates whether or not the given word belongs to L. A (polynomial-size)…