arXiv Analytics

Sign in

arXiv:2105.12671 [math.CO]AbstractReferencesReviewsResources

Constructing Pseudo-involutions in the Riordan Group

Candice Marshall, Asamoah Nkwanta

Published 2021-05-26Version 1

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.

Related articles: Most relevant | Search more
arXiv:math/0404467 [math.CO] (Published 2004-04-26)
Generating Functions of Random Walks on Graphs
arXiv:math/0403546 [math.CO] (Published 2004-03-31)
Neighborhood complexes and generating functions for affine semigroups
arXiv:1312.1141 [math.CO] (Published 2013-12-04, updated 2014-03-27)
On the number of coverings of the sphere ramified over given points