in this paper, we consider an arbitrary binary polynomial sequence {a_n} and then give a lower triangular matrix representation of this sequence. as main result, we obtain a factorization of the innite generalized pascal matrix in terms of this new matrix, using a riordan group approach. further some interesting results and applications are derived.

In the realm of the Riordan group, we consider the characterization of Riordan arrays by means of the Aand 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 Aand Z-sequences of the product of two Riordan arrays are derived from those of the two factors; similar results are obtaine...

They found that transformation of (1) or (2) is related to Fibonacci numbers. Recently, Shapiro et al. [8] and Sprugnoli [10] introduced the theories of the Riordan array and the Riordan group, respectively, in an effort to answer the following question: What are the conditions under which a combinatorial sum can be evaluated by transforming the generating function? We think that the works of G...

The Riordan group is a group of infinite lower triangular matrices that are defined by two generating functions, g and f . The kth column of the matrix has the generating function gfk. In the Double Riordan group there are two generating function f1 and f2 such that the columns, starting at the left, have generating functions using f1 and f2 alternately. Examples include Dyck paths with level s...

We define the Sheffer group of all Sheffer-type polynomials and prove the isomorphism between the Sheffer group and the Riordan group. An equivalence of the Riordan array pair and generalized Stirling number pair is also presented. Finally, we discuss a higher dimensional extension of Riordan array pairs. AMS Subject Classification: 05A15, 11B73, 11B83, 13F25, 41A58