paper

Falling Factorials, Generating Functions, and Conjoint Ranking Tables

arXiv:0810.3327

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.

15 pages, 3 figures

Cited by in corpus (1)