Symmetric polynomials, Pascal matrices, and Stirling matrices

We consider lower-triangular matrices consisting of symmetric polynomials, and we show how to factorize and invert them. Since binomial coefficients and Stirling numbers can be represented in terms of symmetric polynomials, these results contain factorizations and inverses of Pascal and Stirling matrices as special cases. This work generalizes that of several other authors on Pascal and Stirling matrices.     

Bernoulli polynomials and Pascal matrices in the context of Clifford analysis

This paper describes an approach to generalized Bernoulli polynomials in higher dimensions by using Clifford algebras. Due to the fact that the obtained Bernoulli polynomials are special hypercomplex holomorphic (monogenic) functions in the sense of Clifford Analysis, they have properties very similar to those of the classical polynomials. Hypercomplex Pascal and Bernoulli matrices are defined and studied, thereby generalizing results recently obtained by Zhang and Wang (Z. Zhang, J. Wang, Bernoulli matrix and its algebraic properties, Discrete Appl. Math. 154 (11) (2006) 1622-1632).     

On a connection between the Pascal, Stirling and Vandermonde matrices

In this paper, we are going to study some additional relations between the Stirling matrix S_n and the Pascal matrix P_n. Also the representation for the matrix T_n and in terms of s_n and S_n will be considered. Consequently, this will give an answer to an open problem proposed by EI-Mikkawy [On a connection between the Pascal, Vandermonde and Stirling matrices—II, Appl. Math. Comput. 146 (2003) 759-769].     

The problem of generalized Green matrices

Azbelev's W-method is used for the construction of the theory of the generalized Green matrices. In this way one finds a class of matrices which preserve the form of the solution of the boundary value problem with a well-defined right-hand side in the case when this problem is uniquely solvable.     

A connection between a generalized Pascal matrix and the hypergeometric function

The n × n generalized Pascal matrix P(t) whose elements are related to the hypergeometric function ₂F₁(a, b; c; x) is presented and the Cholesky decomposition of P(t) is obtained. As a result, it is shown that

Full-size image

is the solution of the Gauss's hypergeometric differential equation,

x(1 − x)y″ + [1 + (a + b − 1)x]y′ − ABY = 0

. where a and b are any nonnegative integers. Moreover, a recurrence relation for generating the elements of P(t) is given.     

Mixtures of order matrices and generalized order matrices

This paper deals with matrix representations of linear orders, mixtures of order matrices and the non-integral solutions of the linear systems defining them.     

The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices

Let Gn（C） be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and Gc（Jr~） the set of all primitive matrices in Gn（C）. In this paper, some necessary and sufficient conditions for A in the semigroup Gn（C） to be primitive are given. We also show that Gc（Jn） is a subsemigroup of Gn（C）.     

The question of equivalence for generalized Hausdorff matrices

In the present paper we investigate when Hausdorff matrices and generalized Hausdorff matrices, with the same mass function, are equivalent, as bounded operators on c and ?p.     

Invariant factors and generalized Schur matrices

The invariant factors of a generalization of the Schur matrix are found.     

On generalized strongly nilpotent matrices

By a theorem of Levitzki, we prove that a generalized strongly nilpotent matrix is similar to a upper triangular matrix with zero diagonal by a scalar matrix, which generalizes a recent result by van den Essen and Hubbers. We also show that a special case of a conjecture of Connell and Zweibel is true.     

Eigenvalues for generalized Hausdorff matrices

We introduce a new class of generalized Hausdorff matrices and show that their eigenvalues and corresponding eigenspaces can be obtained very easily. We also consider these matrices as operators on ^p (1p).