Search Results for ""

A polynomial sequence p_n(x) is called the basic polynomial sequence for a delta operator Q if 1. p_0(x)=1, 2. p_n(0)=0 for all n>0, 3. Qp_n(x)=np_(n-1)(x). If p_n(x) is a ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

Based on a problem in particle physics, Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) is the multinomial ...

For all integers n and nonnegative integers t, the harmonic logarithms lambda_n^((t))(x) of order t and degree n are defined as the unique functions satisfying 1. ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...

A generalization of simple majority voting in which a list of quotas {q_0,...,q_n} specifies, according to the number of votes, how many votes an alternative needs to win ...

The trinomial triangle is a number triangle of trinomial coefficients. It can be obtained by starting with a row containing a single "1" and the next row containing three 1s ...

The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...