AbstractWe study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x),h(x)) defining the Riordan array
We give an alternative proof of an identity that appeared recently in Integers. By using the concept...
The main objects of our study are the algebraic structure of Riordan arrays, the properties of subg...
The notion of a p-Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the...
AbstractWe study the relation between binary words excluding a pattern and proper Riordan arrays. In...
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily st...
AbstractWe consider some Riordan arrays related to binary words avoiding a pattern p, which can be e...
AbstractWe use an algebraic approach to study the connection between generating trees and proper Rio...
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach ...
A Riordan array = ((), ()) is defined as an infinite lower triangular matrix whose generating funct...
In the realm of the Riordan group, we consider the characterization of Riordan arrays by means of th...
AbstractIn the realm of the Riordan group, we consider the characterization of Riordan arrays by mea...
AbstractThe concept of a Riordan array is used in a constructive way to find the generating function...
Here presented are the definitions of (c)-Riordan arrays and (c)-Bell polynomials which are extensio...
Riordan arrays have been used as a powerful tool for solving applied algebraic and enumerative comb...
AbstractWe find the generating function counting the total internal path length of any proper genera...
We give an alternative proof of an identity that appeared recently in Integers. By using the concept...
The main objects of our study are the algebraic structure of Riordan arrays, the properties of subg...
The notion of a p-Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the...
AbstractWe study the relation between binary words excluding a pattern and proper Riordan arrays. In...
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily st...
AbstractWe consider some Riordan arrays related to binary words avoiding a pattern p, which can be e...
AbstractWe use an algebraic approach to study the connection between generating trees and proper Rio...
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach ...
A Riordan array = ((), ()) is defined as an infinite lower triangular matrix whose generating funct...
In the realm of the Riordan group, we consider the characterization of Riordan arrays by means of th...
AbstractIn the realm of the Riordan group, we consider the characterization of Riordan arrays by mea...
AbstractThe concept of a Riordan array is used in a constructive way to find the generating function...
Here presented are the definitions of (c)-Riordan arrays and (c)-Bell polynomials which are extensio...
Riordan arrays have been used as a powerful tool for solving applied algebraic and enumerative comb...
AbstractWe find the generating function counting the total internal path length of any proper genera...
We give an alternative proof of an identity that appeared recently in Integers. By using the concept...
The main objects of our study are the algebraic structure of Riordan arrays, the properties of subg...
The notion of a p-Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the...
DOI
Add to ORKG