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

DOI10.1016/J.JCTA.2014.02.007zbMATH Open1295.05025DBLPjournals/jct/GSV14arXiv1307.2010OpenAlexW2070395517WikidataQ58082882 ScholiaQ58082882MaRDI QIDQ2451897FDOQ2451897

Authors: J. Fernando Barbero G., Jesús Salas, Eduardo J. S. Villaseñor

Publication date: 26 May 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1307.2010

Recommendations

zbMATH Keywords

exponential generating functions recurrence equations row generating polynomials

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites Work

On the Lambert \(w\) function
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Stirling polynomials
Combinatorics of permutations
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Generalized Stirling permutations, families of increasing trees and urn models
Introduction to enumerative combinatorics. With a foreword by Richard Stanley
Inverse descents of \(r\)-multipermutations
Title not available (Why is that?)
Generalized Stirling and Lah numbers
A Ramanujan sequence that refines the Cayley formula for trees
Combinatorial interpretation of generalized Stirling numbers
Title not available (Why is that?)
On solutions to a general combinatorial recurrence
Recursively defined combinatorial functions: Extending Galton's board
Ramanujan grammar and Cayley trees
Title not available (Why is that?)
Apropos Two Notes on Notation

Cited In (20)

Title not available (Why is that?)
The \(r\)-Lah numbers
Triangular sequences, combinatorial recurrences and linear difference equations
Title not available (Why is that?)
Some applications of the generalized Eulerian numbers
An asymptotic distribution theory for Eulerian recurrences with applications
The binomial recurrence
Recurrent combinatorial sums and binomial-type theorems
Some combinatorial identities of the \(r\)-Whitney-Eulerian numbers
Bivariate generating functions for involutions restricted by 3412
Triangular recurrences, generalized Eulerian numbers, and related number triangles
Generating functions for vector partition functions and a basic recurrence relation
Generalized \(r\)-Lah numbers
Eulerian pairs and Eulerian recurrence systems
Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
Combinatorial recurrences and linear difference equations
A polynomial generalization of some associated sequences related to set partitions
Exponential-type extended Riordan arrays and reciprocity law for generalized Stirling numbers
Multivariate linear recurrences and power series division

Uses Software

OEIS

This page was built for publication: Bivariate generating functions for a class of linear recurrences: general structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451897)