Related papers: Diagonals in Riordan matrices and applications
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are characterized, using recursive formulas. Furthermore, the…
In this work, we give some criteria that allow us to decide when two sequences of matrix-valued orthogonal polynomials are related via a Darboux transformation and to build explicitly such transformation. In particular, they allow us to see…
We translate the concept of succession rule and the ECO method into matrix notation, introducing the concept of a production matrix. This allows us to combine our method with other enumeration techniques using matrices, such as the method…
The authors of this paper have used the theory of Riordan matrices to introduce the notion of a Riordan graph in \cite{CJKM}. Riordan graphs are proved to have a number of interesting (fractal) properties, and they are a far-reaching…
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…
The aim of this paper is to study some aspects of matrix theory through Pasting and Reversing. We start giving a summary of previous results concerning to Pasting and Reversing over vectors and matrices, after we rewrite such properties of…
Sigmoid functions play an important role in many areas of applied mathematics, including machine learning, population dynamics and probability. We place the study of sigmoid functions in the context of the derivative sub-group of the group…
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal…
Starting from the Rodrigues representation of polynomial solutions of the general hypergeometric-type differential equation complementary polynomials are constructed using a natural method. Among the key results is a generating function in…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…
We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…
We define a generalization of Chacon's classical automorphism and answer the question of whether its important properties remain. We calculate the family of polynimials representing the automorphism, given in recurrence formulae, and infer…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…