Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Riordan arrays and combinatorial sums
Discrete Mathematics
Riordan arrays and the Abel-Gould identity
Discrete Mathematics
Underdiagonal lattice paths with unrestricted steps
Discrete Applied Mathematics
Generating trees and proper Riordan arrays
Discrete Mathematics
Inverse relations and Schauder bases
Journal of Combinatorial Theory Series A
Bijections and the Riordan group
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Waiting patterns for a printer
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Note: Self-inverse Sheffer sequences and Riordan involutions
Discrete Applied Mathematics
Hi-index | 0.04 |
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamical interpretation of certain arithmetical triangles introduced herein. Later we recognize, as a special case of our construction, the so-called Riordan group which is a device used in combinatorics. In this manner we give a new and alternative way to construct the proper Riordan arrays. Our point of view allows us to give a natural metric on the Riordan group turning this group into a topological group. This construction allows us to recognize a countable descending chain of normal subgroups.