Related papers: Paperfolding and Catalan numbers
We describe one interpretation of the q-Catalan numbers in frameworks of random matrix theory and weighted partitions of the set of integers.
We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…
We present an integral expression of the Catalan numbers, based on F\'eaux' integral representation of $\log\left[\Gamma(x)\right]$, $\Gamma$ being the usual Gamma function. The obtained formula may be the starting point of the derivation…
On an elliptic surface or threefold, Catalan numbers appear when one tries to compute the autoequivalence group action on the Bridgeland stability manifold. We explain why this happens by identifying a class of equations in the Chow ring of…
The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the…
In this short note, we describe a problem in algebraic geometry where the solution involves Catalan numbers. More specifically, we consider the derived category of coherent sheaves on an elliptic surface, and the action of its…
Let $n\geq2$ be an integer. In this paper, we study the convexity of the so-called MacMahon's $q$-Catalan polynomials $C_n(q)=\frac1{[n+1]_q}\left[ 2n \atop n \right]_q$ as functions of $q$. Along the way, several intermediate results on…
It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…
Two new identities about Catalan numbers are treated with Zeilberger's algorithm and Watson's hypergeometric series evaluation.
In this paper, we introduce the degenerate central factorial polynomials and numbers of the second kind which are degenerate versions of the central factorial polynomials and numbers of the second kind. We derive some properties and…
We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…
Starting with a definition based on the Catalan numbers, we carry out an empirical study of the Rueppel sequence. We use the Hankel transform as the main technique. By means of this transform we find links to such sequences as the Jacobi…
We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…
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…
Generating functions related to Catalan words and frequencies of digits are obtained using continued fractions. This is fast, elegant, and flexible. It follows the philosophy of Philippe Flajolet from 1980.
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…
We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
We show that the Schubert polynomial S_w specializes to the Catalan number C_n when $w=1(n+1)...2$. Several proofs of this result as well as a q-analog are given. An application to the singularities of Schubert varieties is given.