English
Related papers

Related papers: Are the Catalan Numbers a Linear Recurrence Sequen…

200 papers

We confirm a conjectural supercongruence involving Catalan numbers, which is one of the 100 selected open conjectures on congruences of Sun. The proof makes use of hypergeometric series identities and symbolic summation method.

Number Theory · Mathematics 2020-01-14 Ji-Cai Liu

The aim of this paper is two-fold. We first prove several new interpretations of a kind of $(q,t)$-Catalan numbers along with their corresponding $\gamma$-expansions using pattern avoiding permutations. Secondly, we give a complete…

Combinatorics · Mathematics 2018-10-16 Shishuo Fu , Dazhao Tang , Bin Han , Jiang Zeng

We give conjectures on the form of families of integer sequences whose Hankel transforms are, respectively, $(\alpha, \beta)$ Somos $4$ sequences, $(\alpha, 0, \gamma)$ Somos $6$ sequences, and $(\alpha, \beta, \gamma, \delta)$ Somos $8$…

Combinatorics · Mathematics 2022-11-24 Paul Barry

The existence of infinitely many consecutive prime triples $p_n$, $ p_{n+1}$, and $p_{n+2}$ as $n \to \infty$, is sufficient to prove that the Catalan constant $\beta(2)=0.9159655941\ldots $ is an irrational number. This note provides the…

General Mathematics · Mathematics 2022-07-29 N. A. Carella

The Super-Catalan numbers are a generalization of the Catalan numbers defined as $T(m,n) = \frac{(2m)!(2n)!}{2m!n!(m+n)!}$. It is an open problem to find a combinatorial interpretation for $T(m,n)$. We resolve this for $m=3,4$ using a…

Combinatorics · Mathematics 2020-08-04 Irina Gheorghiciuc , Gidon Orelowitz

A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…

Discrete Mathematics · Computer Science 2010-11-17 Stefano Bilotta , Filippo Disanto , Renzo Pinzani , Simone Rinaldi

We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…

Combinatorics · Mathematics 2011-09-06 Alon Regev

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…

Combinatorics · Mathematics 2021-10-25 Nickolas Hein , Jia Huang

We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super…

Combinatorics · Mathematics 2015-02-26 Thomas M. Richardson

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,…

Combinatorics · Mathematics 2009-01-23 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…

Mathematical Physics · Physics 2022-04-15 Jins de Jong , Alexander Hock , Raimar Wulkenhaar

Ascent sequences are those consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it and have been shown to be equinumerous with the (2+2)-free posets of the same size.…

Combinatorics · Mathematics 2014-03-28 David Callan , Toufik Mansour , Mark Shattuck

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Number Theory · Mathematics 2018-02-15 Claude Levesque , Michel Waldschmidt

Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…

Combinatorics · Mathematics 2026-02-10 Ian M. Musson

Using techniques from the theories of convex polytopes, lattice paths, and indirect influences on directed manifolds, we construct continuous analogues for the binomial coefficients and the Catalan numbers. Our approach for constructing…

Combinatorics · Mathematics 2016-04-26 Leonardo Cano , Rafael Diaz

We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…

Combinatorics · Mathematics 2026-04-14 Miklos Bona

The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…

Combinatorics · Mathematics 2021-02-11 Paul E. Gunnells

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

Combinatorics · Mathematics 2015-12-29 Robin DaPao Zhou

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…

Combinatorics · Mathematics 2013-05-10 Yidong Sun , Fei Ma

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

Combinatorics · Mathematics 2016-03-22 Kevin Topley