English
Related papers

Related papers: On the Convergence of the Catalan Generating Funct…

200 papers

In this note, we derive an alternative recursive formula for the sums of powers of integers involving the Stirling numbers of the first kind. As a remarkable by-product, we provide a non-recursive definition of the Catalan numbers.

Combinatorics · Mathematics 2021-03-09 José Luis Cereceda

Using, as main tool, the convergence theorem for discrete martingales and the mean value property of harmonic functions we solve, a particular case of, Dirichlet problem.

Probability · Mathematics 2010-10-29 José Villa

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

General Mathematics · Mathematics 2021-09-24 Ali Chtatbi

We prove a recursion formula for generating functions of certain renormalizations of *-moments of the DT(\delta_0,1)-operator T, involving an operation \odot on formal power series and a transformation E that converts \odot to usual…

Combinatorics · Mathematics 2007-05-23 Ken Dykema , Catherine Yan

A Catalan word $w$ is said to be flattened if the subsequence of $w$ obtained by taking the first letter of each weakly increasing run is nondecreasing. Let $\mathcal{F}_n$ denote the set of flattened Catalan words of length $n$, which has…

Combinatorics · Mathematics 2025-02-18 Mark Shattuck

We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…

Combinatorics · Mathematics 2022-04-12 Kunle Adegoke , Robert Frontczak , Taras Goy

We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…

Combinatorics · Mathematics 2018-01-30 Michael H. Albert , Cheyne Homberger , Jay Pantone , Nathaniel Shar , Vincent Vatter

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

Combinatorics · Mathematics 2024-04-16 Nadia Na Li , Wenchang Chu

It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…

Number Theory · Mathematics 2020-01-22 Helmut Prodinger , Sarah J. Selkirk

Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades

The generating function of the cumulants in random matrix models, as well as the cumulants themselves, can be expanded as asymptotic (divergent) series indexed by maps. While at fixed genus the sums over maps converge, the sums over genera…

Mathematical Physics · Physics 2014-09-08 Razvan Gurau , Thomas Krajewski

This work is a continuation of some recent articles presenting enumerative results for Catalan words avoiding one or a pair of consecutive or classical patterns of length $3$. More precisely, we provide systematically the bivariate…

Combinatorics · Mathematics 2023-02-27 Jean-Luc Baril , José Luis Ramírez

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…

Combinatorics · Mathematics 2017-10-18 Kyu-Hwan Lee , Se-jin Oh

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…

Combinatorics · Mathematics 2022-02-03 Parth Chavan , Andrew Lee , Karthik Seetharaman

We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.

Combinatorics · Mathematics 2007-05-23 Roland Bacher

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…

Mathematical Software · Computer Science 2019-09-17 Paul Tarau

The exponential generating function of ordinary generating functions of diagonal sequences of general Sheffer triangles is computed by an application of Lagrange's theorem. For the special Jabotinsky type this is already known. An analogous…

Number Theory · Mathematics 2017-08-07 Wolfdieter Lang

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

Number Theory · Mathematics 2013-11-19 James Haley

We prove exact product formulas for the tiling generating functions of various halved hexagons and quartered hexagons with defects on boundary. Our results generalize the previous work of the first author and the work of Ciucu.

Combinatorics · Mathematics 2022-01-25 Tri Lai , Ranjan Rohatgi

The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…

Symplectic Geometry · Mathematics 2015-06-26 Alberto S. Cattaneo , Benoit Dherin , Giovanni Felder