AbstractThe theory of binomial enumeration leads to sequences of functions of binomial type which are not polynomials. The results of Mullin-Rota for these sequences are developed and a ring structure on the set of sequences is studied
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
AbstractThe theory of binomial enumeration leads to sequences of functions of binomial type which ar...
AbstractA paper by D.L. Reiner researched function sequences of binomial type and established many i...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
AbstractThis paper concerns the study of the Bell polynomials and the binomial type sequences. We ma...
AbstractWe give a method for enumerating sequences over a finite alphabet with respect to certain ma...
Sequences of binomial type are thoroughly structured polynomial sequences. We view them as being par...
AbstractThis paper gives a combinatorial derivation of the counting series ψm (alternatively ψm∗) fo...
AbstractWe introduce the problem of establishing a central limit theorem for the coefficients of a s...
For a sequence $f = (f_1, f_2, \dots)$ of nonzero integers, define $\Delta(f)$ to be the numerical t...
AbstractWith the binomial coefficients (kn) being defined for all integers n,k, several forms of the...
AbstractA family of polynomial sequences, named G-R-sequences, is introduced and its connections wit...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
AbstractThe theory of binomial enumeration leads to sequences of functions of binomial type which ar...
AbstractA paper by D.L. Reiner researched function sequences of binomial type and established many i...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
AbstractThis paper concerns the study of the Bell polynomials and the binomial type sequences. We ma...
AbstractWe give a method for enumerating sequences over a finite alphabet with respect to certain ma...
Sequences of binomial type are thoroughly structured polynomial sequences. We view them as being par...
AbstractThis paper gives a combinatorial derivation of the counting series ψm (alternatively ψm∗) fo...
AbstractWe introduce the problem of establishing a central limit theorem for the coefficients of a s...
For a sequence $f = (f_1, f_2, \dots)$ of nonzero integers, define $\Delta(f)$ to be the numerical t...
AbstractWith the binomial coefficients (kn) being defined for all integers n,k, several forms of the...
AbstractA family of polynomial sequences, named G-R-sequences, is introduced and its connections wit...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
DOI
Add to ORKG