Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Riordan arrays and combinatorial sums
Discrete Mathematics
A divisibility property for a subgroup of Riordan matrices
Discrete Applied Mathematics
Bijections and the Riordan group
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Hi-index | 0.00 |
The hitting time subgroup is a subgroup of the Riordan group and it came up recently in connection with Faber polynomials as studied in classical complex analysis. It turns out that the hitting time subgroup also arises in situations involving random walks and often is the distinguished leaf generating function for classes of ordered trees. These connections are the main focus of this paper.