Related papers: Diagonals in Riordan matrices and applications
The paper develops the method for construction of families of particular solutions to some classes of nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic matrix equations and PDE.…
This paper establishes relationships between elliptic functions and Riordan arrays leading to new classes of Riordan arrays which here are called elliptic Riordan arrays. In particular, the case of Riordan arrays derived from Jacobi…
We study a family of Riordan arrays whose square symmetrizations lead to the Robbins numbers as well as numbers associated to the $20$ vertex model. We provide closed-form expressions for the elements of these arrays, and also give a…
Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
We point out how to use the classical characteristic method, that is used to solve quasilinear PDE's, to obtain the matrix exponential of some lower triangle infinite matrices. We use the Lie Frechet structure of the Riordan group described…
It is shown how one can apply the classification of the holonomy algebras of Lorentzian manifolds to solve some problems. In particular, a new proof to the classification of Lorentzian manifolds with recurrent curvature tensor is given; the…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.
We provide a self-contained introduction to random matrices. While some applications are mentioned, our main emphasis is on three different approaches to random matrix models: the Coulomb gas method and its interpretation in terms of…
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We prove a parametric generalization of the classical Poincare-Perron theorem on stabilizing recurrence relations where we assume that the varying coefficients of a recurrence depend on auxiliary parameters and converge uniformly in these…
When the co-recursion and co-dilation in the recurrence relation of certain sequences of orthogonal polynomials are not at the same level, the behaviour of the modified orthogonal polynomials is expected to have different properties…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
We construct a new family of strong linearizations of rational matrices considering the polynomial part of them expressed in a basis that satisfies a three term recurrence relation. For this purpose, we combine the theory developed by…
We study the Hankel transforms of sequences related to the central coefficients of a family of Pascal-like triangles. The mechanism of Riordan arrays is used to elucidate the structure of these transforms.
In this paper, we study symmetric lattice paths. Let $d_{n}$, $m_{n}$, and $s_{n}$ denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schr\"oder paths of length $2n$, respectively. By using Riordan group…
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…