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.     

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.     

Riordan arrays associated with Laurent series and generalized Sheffer-type groups

A relationship between a pair of Laurent series and Riordan arrays is formulated. In addition, a type of generalized Sheffer groups is defined by using Riordan arrays with respect to power series with non-zero coefficients. The isomorphism between a generalized Sheffer group and the group of the Riordan arrays associated with Laurent series is established. Furthermore, Appell, associated, Bell, and hitting-time subgroups of the groups are defined and discussed. A relationship between the generalized Sheffer groups with respect to different type of power series is presented. The equivalence of the defined Riordan array pairs and generalized Stirling number pairs is given. A type of inverse relations of various series is constructed by using pairs of Riordan arrays. Finally, several applications involving various arrays, polynomial sequences, special formulas and identities are also presented as illustrative examples.     

Half Inverse Riordan Arrays and Their Related Vertical Recurrence Relation

We discuss two different procedures to study the half Riordan arrays and their inverses. One of the procedures shows that every Riordan array is the half Riordan array of a unique Riordan array. It is well known that every Riordan array has its half Riordan array. Therefore, this paper answers the converse question: Is every Riordan array the half Riordan array of some Riordan arrays? In addition, this paper shows that the vertical recurrence relation of the column entries of the half Riordan array is equivalent to the horizontal recurrence relation of the original Riordan array''s row entries.     

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.     

Riordan arrays and generalized Lagrange series

The theory of Riordan arrays studies the properties of formal power series and their sequences. The notion of generalized Lagrange series proposed in the present paper is intended to fill the gap in the methodology of this theory. Generalized Lagrange series appear in it implicitly, as various equalities. No special notation is provided for these series, although particular cases of these series are generalized binomial and generalized exponential series. We give the definition of generalized Lagrange series and study their relationship with ordinary Riordan arrays and, separately, with Riordan exponential arrays.     

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

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

On pseudo-involutions,involutions and quasi-involutions in the group of almost Riordan arrays

Journal of Algebraic Combinatorics - The group of almost Riordan arrays contains the group of Riordan arrays as a subgroup. In this note, we exhibit examples of pseudo-involutions, conditions under...     

Sequence characterization of Riordan arrays

In the realm of the Riordan group, we consider the characterization of Riordan arrays by means of the A- and Z-sequences. It corresponds to a horizontal construction of a Riordan array, whereas the traditional approach is through column generating functions. We show how the A- and Z-sequences of the product of two Riordan arrays are derived from those of the two factors; similar results are obtained for the inverse. We also show how the sequence characterization is applied to construct easily a Riordan array. Finally, we give the characterizations relative to some subgroups of the Riordan group, in particular, of the hitting-time subgroup.     

Algebraic properties of Riordan subgroups

Journal of Algebraic Combinatorics - We present properties of the group structure of Riordan arrays. We examine similar properties among known Riordan subgroups, and from this, we define...     

Products of Riordan arrays of finite orders

Journal of Algebraic Combinatorics - We prove that every Riordan array over $$\mathbb {C}$$ whose main diagonal consists only of ones can be written as a product of at most five Riordan arrays of...     

Combinatorial sums through Riordan arrays

The aim of this work is to show how Riordan arrays are able to generate and close combinatorial identities, by means of the method of coefficients (generating functions). We also show how the same approach can be used to deal with other combinatorial problems, for instance asymptotic approximation and combinatorial inversion. Finally, we propose a method for generating new combinatorial sums by extending the concept of Riordan arrays to bi-infinite matrices.     

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.     

Generalized harmonic numbers with Riordan arrays

By observing that the infinite triangle obtained from some generalized harmonic numbers follows a Riordan array, we obtain very simple connections between the Stirling numbers of both kinds and other generalized harmonic numbers. Further, we suggest that Riordan arrays associated with such generalized harmonic numbers allow us to find new generating functions of many combinatorial sums and many generalized harmonic number identities.     

Hsu-Riordan 阵/partial monoid

本文首先对Shapiro的Riordan群进行了推广。给出了Hsu-Riordan partial monoid的概念，然后在此框架内，对徐利治先生的两类扩展型广义Stirling数偶进行了统一处理；建立了Hsu-Wang转换定理。Brown-Sprugnoli转换公式，以及广义Brown转换引理-它揭示了一些不同类型的Hsu-Riordan阵之间转换的方法。由此可产生大量的恒等式。     

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

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

Proper generating trees and their internal path length

We find the generating function counting the total internal path length of any proper generating tree. This function is expressed in terms of the functions (d(t),h(t)) defining the associated proper Riordan array. This result is important in the theory of Riordan arrays and has several combinatorial interpretations.     

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.     

The Cauchy numbers

We study many properties of Cauchy numbers in terms of generating functions and Riordan arrays and find several new identities relating these numbers with Stirling, Bernoulli and harmonic numbers. We also reconsider the Laplace summation formula showing some applications involving the Cauchy numbers.     

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.