A & Z Sequences for Double Riordan Arrays

A Riordan array is an infinite lower triangular matrix that is defined by two generating functions, g and f. The coefficients of the generating function g give the zeroth column and the nth column of the matrix is defined by the generating function \(gf^{n}\). We shall call f the multiplier function. Similarly, the Double Riordan array is an infinite lower triangular matrix that is defined by three generating functions, g, \(f_{1}\) and \(f_{2}\). Where the zeroth column of the Double Riordan array is g, the next column is given by \(gf_{1}\) and the following column will be defined by \(gf_{1}f_{2}\). The remaining columns are found by multiplying \(f_{1}\) and \(f_{2}\) alternatively. Thus, for a double Riordan array there are two multiplier functions, \(f_1\) and \(f_2.\) It is well known that any Riordan array can be determined by a Z-sequence and an A-sequence. This is the row construction of the array. This is not the case for Double Riordan arrays. In this paper, we show that double Riordan arrays can be determined by two Z-sequences and one A-sequence.

This research was made possible by the generous support of the National Security Agency (NSA), Mathematical Association of America (MAA), and National Science Foundation (NSF) grant DUE-1356481.

Authors and Affiliations

1. Morehouse College, Atlanta, GA, USA

   Donovan Branch & Geoffrey Thorpe

2. Howard University, Washington, DC, USA

   Dennis Davenport & Shakuan Frankson

3. Clark Atlanta University, Atlanta, GA, USA

   Jazmin T. Jones

Corresponding author

Correspondence to Dennis Davenport .

Editors and Affiliations

1. Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL, USA

   Frederick Hoffman

Reprints and permissions

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

Policies and ethics