Search results
Results from the WOW.Com Content Network
This is also known as a falling factorial or backward factorial, and the () notation is a Pochhammer symbol. [96] Falling factorials count the number of different sequences of n {\displaystyle n} distinct items that can be drawn from a universe of x {\displaystyle x} items. [ 97 ]
The factorial number system is sometimes defined with the 0! place omitted because it is always zero (sequence A007623 in the OEIS). In this article, a factorial number representation will be flagged by a subscript "!". In addition, some examples will have digits delimited by a colon. For example, 3:4:1:0:1:0! stands for
In this article, the symbol () is used to represent the falling factorial, and the symbol () is used for the rising factorial. These conventions are used in combinatorics , [ 4 ] although Knuth 's underline and overline notations x n _ {\displaystyle x^{\underline {n}}} and x n ¯ {\displaystyle x^{\overline {n}}} are increasingly popular.
The final expression is defined for all complex numbers except the negative even integers and satisfies (z + 2)!! = (z + 2) · z!! everywhere it is defined. As with the gamma function that extends the ordinary factorial function, this double factorial function is logarithmically convex in the sense of the Bohr–Mollerup theorem.
Díaz and Pariguan use these definitions to demonstrate a number of properties of the hypergeometric function. Although Díaz and Pariguan restrict these symbols to k > 0, the Pochhammer k-symbol as they define it is well-defined for all real k, and for negative k gives the falling factorial, while for k = 0 it reduces to the power x n.
1698 (perhaps deriving from a much earlier use of middle dot to separate juxtaposed numbers) division slash (a.k.a. solidus ) 1718 (deriving from horizontal fraction bar, invented by Abu Bakr al-Hassar in the 12th century)
The q-Pochhammer symbol is closely related to the enumerative combinatorics of partitions.The coefficient of in (;) = = is the number of partitions of m into at most n parts.
The sum of the numbers in the factorial number system representation gives the number of inversions of the permutation, and the parity of that sum gives the signature of the permutation. Moreover, the positions of the zeroes in the inversion table give the values of left-to-right maxima of the permutation (in the example 6, 8, 9) while the ...