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 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 innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

An involutory upper triangular Pascal matrix Un is investigated. Eigenvectors of Un and of UT n are considered. A characterization of Un is obtained, and it is shown how the results can be extended to matrices over a commutative ring with unity. © 2004 Elsevier Inc. All rights reserved.

The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Töeplitz matrix and a unipotent upper triangular matrix. The determinant of a generalized Pascal matrix equals thus the determinant of a Töeplitz matrix. This equa...

The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see R. Bacher. Determinants of matrices related to the Pascal triangle. J. Théor. Nombres Bordeaux, 14:19–41, 2002). This article presents a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Toeplitz matrix, and a unipotent upper triang...

This work is devoted to a systematic investigation of triangular matrix forms of the Pascal Triangle. To start, the twelve matrix forms (collectively referred to as G-matrices) are presented. To highlight one way in which the G-matrices relate to each other, a set of four operators named circulant operators is introduced. These operators provide a new insight into the structure of the space of ...

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

Recently the creation matrix, intimately related to the Pascal matrix and its generalizations, has been used to develop matrix representations of special polynomials, in particular Appell polynomials. In this paper we describe a matrix approach to polynomials in several hypercomplex variables based on special block matrices whose structures simulate the creation matrix and the Pascal matrix. We...