Recurrent combinatorial sums and binomial-type theorems
zbMATH Open1471.11092MaRDI QIDQ5113651FDOQ5113651
Authors: Michael Z. Spivey 
Publication date: 15 June 2020
Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL23/Spivey/spivey36.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
binomial coefficientrecurrence relationStirling numberbinomial theoremEulerian numberLah numbercombinatorial sum
Numerical summation of series (65B10) Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Recurrences (11B37) Binomial coefficients; factorials; (q)-identities (11B65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bivariate generating functions for a class of linear recurrences: general structure
- Title not available (Why is that?)
- On solutions to a general combinatorial recurrence
- Recursively defined combinatorial functions: Extending Galton's board
- A combinatorial proof for the alternating convolution of the central binomial coefficients
- A combinatorial approach to a general two-term recurrence
- The Art of Proving Binomial Identities
Cited In (8)
- On recurrences for sums of powers of binomial coefficients
- A combinatorial approach to a general two-term recurrence
- The combinatorialization of linear recurrences
- On solutions to a general combinatorial recurrence
- Combinatorial sums and implicit Riordan arrays
- Recurrences for alternating sums of powers of binomial coefficients
- Title not available (Why is that?)
- Repetitions of multinomial coefficients and a generalization of Singmaster's conjecture
Uses Software
This page was built for publication: Recurrent combinatorial sums and binomial-type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113651)
