Generalized Riordan arrays

In this paper, we generalize the concept of Riordan array. A generalized Riordan array with respect to c_n is an infinite, lower triangular array determined by the pair (g(t),f(t)) and has the generic element d_n,k=[tⁿ/c_n]g(t)(f(t))^k/c_k, where c_n is a fixed sequence of non-zero constants with c₀=1.We demonstrate that the generalized Riordan arrays have similar properties to those of the classical Riordan arrays. Based on the definition, the iteration matrices related to the Bell polynomials are special cases of the generalized Riordan arrays and the set of iteration matrices is a subgroup of the Riordan group. We also study the relationships between the generalized Riordan arrays and the Sheffer sequences and show that the Riordan group and the group of Sheffer sequences are isomorphic. From the Sheffer sequences, many special Riordan arrays are obtained. Additionally, we investigate the recurrence relations satisfied by the elements of the Riordan arrays. Based on one of the recurrences, some matrix factorizations satisfied by the Riordan arrays are presented. Finally, we give two applications of the Riordan arrays, including the inverse relations problem and the connection constants problem.     

Combinatorial sums and implicit Riordan arrays

In this paper we present the theory of implicit Riordan arrays, that is, Riordan arrays which require the application of the Lagrange Inversion Formula to be dealt with. We show several examples in which our approach gives explicit results, both in finding closed expressions for sums and, especially, in solving classes of combinatorial sum inversions.     

P分之一Riordan矩阵及恒等式构造

For an integer p≥2 we construct vertical and horizontal one-pth Riordan arrays from a Riordan array.When p=2 one-pth Riordan arrays are reduced to well known half Riordan arrays.The generating functions of the A-sequences of vertical and horizontal one-pth Riordan arrays are found.The vertical and horizontal one-pth Riordan arrays provide an approach to construct many identities.They can also be used to verify some well known identities readily.     

Riordan阵与含有Genocchi数的一些恒等式

In this paper, using generating functions and Riordan arrays, we get some identities relating Genocchi numbers with Stirling numbers and Cauchy numbers.     

A symbolic treatment of Riordan arrays

We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical Abel?s identity for polynomials. In particular, we obtain a novel non-recursive formula for Riordan arrays and derive, from this new formula, some known recurrences and a new recurrence relation for Riordan arrays.     

Production Matrices and Riordan Arrays

We translate the concept of succession rule and the ECO method into matrix notation, introducing the concept of production matrix. This allows us to combine our method with other enumeration techniques using matrices, such as the method of Riordan matrices. Finally we treat the case of rational production matrices, i.e., those leading to rational generating functions. L. Ferrari and S. Rinaldi have been partially supported by MIUR project: Linguaggi formali e automi: metodi, modelli e applicazioni.     

New identities in the Catalan triangle

In this paper we prove new identities in the Catalan triangle whose (n,p) entry is defined by

     

Generalized higher order Bernoulli number pairs and generalized Stirling number pairs

From a delta series f(t) and its compositional inverse g(t), Hsu defined the generalized Stirling number pair . In this paper, we further define from f(t) and g(t) the generalized higher order Bernoulli number pair . Making use of the Bell polynomials, the potential polynomials as well as the Lagrange inversion formula, we give some explicit expressions and recurrences of the generalized higher order Bernoulli numbers, present the relations between the generalized higher order Bernoulli numbers of both kinds and the corresponding generalized Stirling numbers of both kinds, and study the relations between any two generalized higher order Bernoulli numbers. Moreover, we apply the general results to some special number pairs and obtain series of combinatorial identities. It can be found that the introduction of generalized Bernoulli number pair and generalized Stirling number pair provides a unified approach to lots of sequences in mathematics, and as a consequence, many known results are special cases of ours.     

Identities on Bell polynomials and Sheffer sequences

In this paper, we study exponential partial Bell polynomials and Sheffer sequences. Two new characterizations of Sheffer sequences are presented, which indicate the relations between Sheffer sequences and Riordan arrays. Several general identities involving Bell polynomials and Sheffer sequences are established, which reduce to some elegant identities for associated sequences and cross sequences.     

Catalan matrix and related combinatorial identities

We introduce the notion of the Catalan matrix whose non-zero elements are expressions which contain the Catalan numbers arranged into a lower triangular Toeplitz matrix. Inverse of the Catalan matrix is derived. Correlations between the matrix and the generalized Pascal matrix are considered. Some combinatorial identities involving Catalan numbers, binomial coefficients and the generalized hypergeometric function are derived using these correlations. Moreover, an additional explicit representation of the Catalan number, as well as an explicit representation of the sum of the first m Catalan numbers are given.     

Riordan 矩阵在广义 Motzkin 路计数中的应用

用Riordan矩阵的方法研究了具有4种步型的加权格路(广义Motzkin路)的计数问题,引入了一类新的计数矩阵,即广义Motzkin矩阵.同时给出了这类矩阵的Riordan表示,也得到了广义Motzkin路的计数公式.Catalan矩阵,Schrder矩阵和Motzkin矩阵都是广义Motzkin矩阵的特殊情形.     

Ultrametrics, Banach’s fixed point theorem and the Riordan group

We interpret the reciprocation process in as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamical interpretation of certain arithmetical triangles introduced herein. Later we recognize, as a special case of our construction, the so-called Riordan group which is a device used in combinatorics. In this manner we give a new and alternative way to construct the proper Riordan arrays. Our point of view allows us to give a natural metric on the Riordan group turning this group into a topological group. This construction allows us to recognize a countable descending chain of normal subgroups.     

Riordan 矩阵的$(m,r,s)$-Halves

Riordan矩阵的垂直一半和水平一半已经被许多学者分别研究过.本文给出了Riordan矩阵的$(m,r,s)$-halves的定义.利用此定义能够统一的讨论Riordan矩阵的垂直一半和水平一半.作为应用,通过对Pascal和Delannoy矩阵的$(m,r,s)$-halves的研究,可以得到了一些与Fibonacci, Pell和Jacobsthal序列相关的等式.     

Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series

We point out how the Banach Fixed Point Theorem, together with the Picard successive approximation methods yielded by it, allows us to treat some mathematical methods in combinatorics. In particular we get, in this way, a proof of and an iterative algorithm for deriving the Lagrange Inversion Formula.     

Moments of combinatorial and Catalan numbers

In this paper we obtain the moments {Φm}_m?0 defined by

     

An identity of Andrews and a new method for the Riordan array proof of combinatorial identities

We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G.E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical arguments. We present a new proof, quite simple and based on a Riordan array argument. The main point of the proof is the construction of a new Riordan array from a given Riordan array, by the elimination of elements. We extend the method and as an application we obtain other identities, some of which are new. An important feature of our construction is that it establishes a nice connection between the generating function of the A-sequence of a certain class of Riordan arrays and hypergeometric functions.     

Self-inverse Sheffer sequences and Riordan involutions

In this short note, we focus on self-inverse Sheffer sequences and involutions in the Riordan group. We translate the results of Brown and Kuczma on self-inverse sequences of Sheffer polynomials to describe all involutions in the Riordan group.     

New proofs of identities of Lebesgue and Göllnitz via tilings

In 1840, V.A. Lebesgue proved the following two series-product identities: