English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/110178
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


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

AuthorsBarbero González, Jesús Fernando ; Salas, J.; Villaseñor, Eduardo J. S.
KeywordsExponential generating functions
Recurrence equations
Row generating polynomials.
Issue Date2014
CitationJournal of Combinatorial Theory - Series A 125: 146- 165 (2014)
AbstractWe 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. © 2014 Elsevier Inc.
Identifiersdoi: 10.1016/j.jcta.2014.02.007
issn: 1096-0899
Appears in Collections:(CFMAC-IEM) Artículos
Files in This Item:
File Description SizeFormat 
Barbero.pdf218,33 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.