2021/05/26 by Candice Marshall, Marshall, Candice, Asamoah Nkwanta +1
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2105.12671
openalex publication_date 2021/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the Fibonacci and modified Lucas numbers. Then, we present some pseudo-involutions in the Riordan group that are based on constructions starting with a certain generating function g(z). We also present a theorem that shows how to construct pseudo-involutions in the Riordan group starting with a certain generating function f(z) whose additive inverse has compositional order 2. The theorem is then used to construct more pseudo-involutions in the Riordan group where some arrays have connections to the Fibonacci and modified Lucas numbers. A MATLAB algorithm for constructing the pseudo-involutions is also given.