Related papers: Recurrence relations for polynomial sequences via …

The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…

The Riordan group, along with its constituent elements, Riordan arrays, has been a tool for combinatorial exploration since its inception in 1991. More recently, this group has made an appearance in the area of mathematical physics, where…

Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…

The 3-term recurrence relation for Hermite polynomials was recently generalized to a recurrence relation for Wronskians of Hermite polynomials. In this note, a similar generalization for Laguerre polynomials is obtained.

The aim of this paper is twofold. First, we demonstrate how Riordan matrices can be employed to connect well-known concepts in geometric combinatorics, such as $f$-vectors, $h$-vectors $\gamma$-vectors, in a similar fashion to the McMullen…

In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…

In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.

We present an algebraic theory of orthogonal polynomials in several variables that includes classical orthogonal polynomials as a special case. Our bottom line is a straightforward connection between apolarity of binary forms and the inner…

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

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…

In this paper we consider a general sequence of orthogonal Laurent polynomials on the unit circle and we first study the equivalences between recurrences for such families and Szego's recursion and the structure of the matrix representation…

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…

We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…

We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…

We establish exact formulae for the persistence probabilities of an AR(1) sequence with symmetric uniform innovations in terms of certain families of polynomials, most notably a family introduced by Mallows and Riordan as enumerators of…

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…

In this research, as the new results of our previously proposed definition for the new class of $2D$ $q$-Appell polynomials, we derive some interesting relations including the recurrence relation and partial $q$-difference equation of the…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Several operations can be defined on the set of all linear recurrent sequences, such as the binomial convolution (Hurwitz product) or the multinomial convolution (Newton product). Using elementary techniques, we prove that this set equipped…