Publication:
Bivariate generating functions for a class of linear recurrences: General structure

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/24596
ISSN: 0097-3165
DOI: https://dx.doi.org/10.1016/j.jcta.2014.02.007
UXXI: AR/0000015196
Files
bivariate_JCT_2014_ps.pdf (592.92 KB)
Publication date
2014-07
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many cases of combinatorial interest for particular choices of the six parameters that define it. We give a complete classification of the partial differential equations satisfied by the exponential generating functions, and solve them in all cases. We also show that the recurrence relations defining the combinatorial numbers appearing in this problem display an interesting degeneracy that we study in detail. Finally, we obtain for all cases the corresponding univariate row generating polynomials.
Description
Keywords
Recurrence equations, Exponential generating functions, Row generating polynomials
Bibliographic citation
Journal of Combinatorial Theory, Series A, 2014, 125, pp. 146-165.
Collections
DM - MSNMI - Artículos de Revistas