The two types of polynomials are related by:
The rising factorial is often written as , and referred to as the Pochhammer symbol (see hypergeometric series). Unfortunately, the falling factorial is also often denoted by , so great care must be taken when encountering this notation.
Unfortunately, the notational conventions for the rising and falling factorials lack a common standard, and are plagued with a fundamental inconsistency. An examination of reference works and textbooks reveals two fundamental sources of notation: works in combinatorics and works dealing with hypergeometric functions.
Works of combinatorics [1,2,3] give greater focus to the falling factorial because of its role in defining the Stirling numbers. The symbol almost always denotes the falling factorial. The notation for the rising factorial varies widely; we find in  and in .
Works focusing on special functions [4,5] universally use to denote the rising factorial and use this symbol in the description of the various flavours of hypergeometric series. Watson  credits this notation to Pochhammer , and indeed the special functions literature eschews “falling factorial” in favour of “Pochhammer symbol”. Curiously, according to Knuth , Pochhammer himself used to denote the binomial coefficient (Note: I haven’t verified this.)
The notation featured in this entry is due to D. Knuth [7,8]. Given the fundamental inconsistency in the existing notations, it seems sensible to break with both traditions, and to adopt new and graphically suggestive notation for these two concepts. The traditional notation, especially in the hypergeometric camp, is so deeply entrenched that, realistically, one needs to be familiar with the traditional modes and to take care when encountering the symbol .
Comtet, Advanced combinatorics.
Jordan, Calculus of finite differences.
Riordan, Introduction to combinatorial analysis.
Erdélyi, et. al., Bateman manuscript project.
Watson, A treatise on the theory of Bessel functions.
Pochhammer, “Ueber hypergeometrische Functionen Ordnung,” Journal für die reine und angewandte Mathematik 71 (1870), 316–352.
Knuth, “Two notes on notation” http://www-cs-faculty.stanford.edu/ knuth/papers/tnn.tex.gzdownload
Greene, Knuth, Mathematics for the analysis of algorithms.
|Date of creation||2013-03-22 12:23:58|
|Last modified on||2013-03-22 12:23:58|
|Last modified by||rmilson (146)|