Recursively defined combinatorial functions: Extending Galton's board

DOI10.1016/S0012-365X(00)00373-3zbMath0994.05003OpenAlexW1983452260MaRDI QIDQ5946746

Erich Neuwirth

Publication date: 2 October 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00373-3

zbMATH Keywords

Stirling numbersmatrix inversionbinomial coefficientsbivariate recurrenceEuler numbersGaussian coefficientsLah numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Related Items

Statistics on wreath products and generalized binomial-Stirling numbers ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Exponential-type extended Riordan arrays and reciprocity law for generalized Stirling numbers ⋮ Triangular recurrences, generalized Eulerian numbers, and related number triangles ⋮ Some applications of the generalized Eulerian numbers ⋮ A combinatorial approach to a general two-term recurrence ⋮ Bivariate generating functions for a class of linear recurrences: general structure ⋮ Combinatorial recurrences and linear difference equations ⋮ A Markov product for tail dependence functions ⋮ Triangular sequences, combinatorial recurrences and linear difference equations ⋮ Unnamed Item ⋮ The solution of the recurrence relationf_n(t)=a_n(t) f_n−1(t)−b_n(t)(∂/∂t) f_n−1(t) ⋮ Inverse relations and Schauder bases