Related papers: On the Convergence of the Catalan Generating Funct…
In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…
Special matrix functions have recently been investigated for regions of convergence, integral representations and the systems of matrix differential equation that these functions satisfy. In this paper, we find the recursion formulas for…
Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…
We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
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 recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
Algorithms for computing rational generating functions of solutions of one-dimensional difference equations are well-known and easy to implement. We propose an algorithm for computing rational generating functions of solutions of…
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…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating…
We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of consecutive generalized Catalan numbers and find their values in the closed form.
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
We introduce an elliptic extension of Clausen-type functions based on a unified recursive framework. Starting from the polylogarithmic master function, we construct a pair of circular functions whose real and imaginary parts correspond to…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
Solutions to a wide variety of transcendental equations can be expressed in terms of the Lambert $\mathrm{W}$ function. The $\mathrm{W}$ function, occurring frequently in applications, is a non-elementary, but now standard mathematical…