Falling Factorials, Generating Functions, and Conjoint Ranking Tables
From MaRDI portal
Abstract: We investigate the coefficients generated by expressing the falling factorial as a linear combination of falling factorial products for . Algebraic and combinatoric properties of these coefficients are discussed, including recurrence relations, closed-form formulae, relations with Stirling numbers, and a combinatorial characterization in terms of conjoint ranking tables.
Recommendations
- Poly-falling factorial sequences and poly-rising factorial sequences
- Several identities involving the falling and rising factorials and the Cauchy, Lah, and Stirling numbers
- scientific article; zbMATH DE number 4193773
- On a class of combinatorial sums involving generalized factorials
- scientific article; zbMATH DE number 7041489
- Classification of the factorial functions of Eulerian binomial and Sheffer posets
- Factorial Stirling matrix and related combinatorial sequences
- Factorial functions and Stirling numbers of fractional orders
- Closed formulas and identities on the Bell polynomials and falling factorials
Cited in
(5)- Applications of Apostol-type numbers and polynomials: approach to techniques of computation algorithms in approximation and interpolation functions
- Poly-falling factorial sequences and poly-rising factorial sequences
- Connection coefficients between generalized rising and falling factorial bases
- A new family of Lerch-type zeta functions interpolating a certain class of higher-order Apostol-type numbers and Apostol-type polynomials
- Formulas for \(p\)-adic \(q\)-integrals including falling-rising factorials, combinatorial sums and special numbers
This page was built for publication: Falling Factorials, Generating Functions, and Conjoint Ranking Tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550095)