Computation of generating functions for renewal sequences is performed by means of the multivariate Lagrange expansion formulae dus to Good (1960), which yields the multifold analogue of Carlitz mixed generating function. As applications, the natural transition is demonstrated from Euler\u27s binomial theorem and the classical Vandermonde convolution formula to Abel identities and Hagen-Rothe formulas, as well as their multifold analogues due to Mohanty & Handa (1969) and Carlitz (1977), respectively
AbstractThe notion of succession rule (system for short) provides a powerful tool for the enumeratio...
The term “Analytic Combinatorics ” refers to the use of complex analytic meth-ods to solve problems ...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
Computation of generating functions for renewal sequences is performed by means of the multivariate...
AbstractSeveral convolution identities, containing many free parameters, are shown to follow in a ve...
AbstractA q-analog of functional composition for Eulerian generating functions is introduced and app...
AbstractSeveral general classes of generating functions are established for a certain sequence of fu...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
AbstractUsing the MacMahon Master Theorem, Carlitz, in (SIAM J. Appl. Math. 26 (1974), 431–436; 8 (1...
The main object of this paper is to show that combined use of the Lagrange expansion and certain ope...
AbstractA pair of general reciprocal formulas is established which is the multifold analog of Gould-...
AbstractWe derive two generating functions and an explicit formula for the polynomials {Hn(x)} studi...
We study higher-dimensional interlacing Fibonacci sequen\-ces, generated via both Chebyshev type fun...
AbstractIn this paper, we tackle the problem of giving, by means of a regular language, a combinator...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
AbstractThe notion of succession rule (system for short) provides a powerful tool for the enumeratio...
The term “Analytic Combinatorics ” refers to the use of complex analytic meth-ods to solve problems ...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
Computation of generating functions for renewal sequences is performed by means of the multivariate...
AbstractSeveral convolution identities, containing many free parameters, are shown to follow in a ve...
AbstractA q-analog of functional composition for Eulerian generating functions is introduced and app...
AbstractSeveral general classes of generating functions are established for a certain sequence of fu...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
AbstractUsing the MacMahon Master Theorem, Carlitz, in (SIAM J. Appl. Math. 26 (1974), 431–436; 8 (1...
The main object of this paper is to show that combined use of the Lagrange expansion and certain ope...
AbstractA pair of general reciprocal formulas is established which is the multifold analog of Gould-...
AbstractWe derive two generating functions and an explicit formula for the polynomials {Hn(x)} studi...
We study higher-dimensional interlacing Fibonacci sequen\-ces, generated via both Chebyshev type fun...
AbstractIn this paper, we tackle the problem of giving, by means of a regular language, a combinator...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
AbstractThe notion of succession rule (system for short) provides a powerful tool for the enumeratio...
The term “Analytic Combinatorics ” refers to the use of complex analytic meth-ods to solve problems ...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...