Recursively defined combinatorial functions: Extending Galton's board

DOI10.1016/S0012-365X(00)00373-3MaRDI QIDQ5946746zbMATH OpenOpenAlexFDO

Authors 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

binomial coefficientsbivariate recurrenceEuler numbersGaussian coefficientsLah numbersmatrix inversionStirling numbers

Mathematics Subject Classification ID

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

Review text

The author studies matrices \(\big(F(n,k)\big)_{n,k\geq 0}\), where the entries satisfy the recurrence NEWLINE\[NEWLINEF(n,k)=a_{n-1,k}F(n-1,k)+b_{n-1,k-1}F(n-1,k-1).NEWLINE\]NEWLINE Under certain initial conditions he calls such arrays Galton arrays. His main focus is what the result of the multiplication of two such ``Galton arrays \(\big(F(n,k)\big)\) and \(\big(G(n,k)\big)\) is, and whether it is again a ``Galton array. The main result is a multiplication theorem for such Galton arrays, which allows also to derive, as a corollary, a theorem about the inversion of (certain) Galton arrays.

Recommendations

• On an extension of a recurrent relation from combinatorics
• Definability of combinatorial functions and their linear recurrence relations
• A combinatorial analysis of functions provably recursive in ΙΣ_n
• scientific article; zbMATH DE number 1303203
• Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
• On solutions to a general combinatorial recurrence
• scientific article; zbMATH DE number 3885889
• Recursive functions on conditional Galton‐Watson trees
• Enumerations of families of general recursive functions
• The combinatorialization of linear recurrences

Cited in

(14)

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

This page was built for publication: Recursively defined combinatorial functions: Extending Galton's board

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946746)