A combinatorial approach to a general two-term recurrence

DOI10.1016/j.dam.2013.03.016zbMath1371.11035OpenAlexW2034588842MaRDI QIDQ2446852

Toufik Mansour, Mark Shattuck

Publication date: 22 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.016

zbMATH Keywords

Stirling numbersrecurrencebinomial coefficientscombinatorial proof

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Recurrences (11B37)

Related Items (6)

Shifting powers in Spivey’s Bell number formula ⋮ Triangular recurrences, generalized Eulerian numbers, and related number triangles ⋮ A polynomial generalization of some associated sequences related to set partitions ⋮ A Markov product for tail dependence functions ⋮ The Binomial Recurrence ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a new family of generalized Stirling and Bell numbers
• A maj statistic for set partitions
• \(p,q\)-Stirling numbers and set partition statistics
• Degenerate weighted Stirling numbers
• Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
• A unified approach to generalized Stirling numbers
• Explicit formulas and combinatorial identities for generalized Stirling numbers
• Statistics on wreath products and generalized binomial-Stirling numbers
• \(q\)-Bernoulli numbers and polynomials
• Recursively defined combinatorial functions: Extending Galton's board

This page was built for publication: A combinatorial approach to a general two-term recurrence