Search Results for ""

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

The BCI triangle DeltaA^'B^'C^' of a triangle DeltaABC with incenter I is defined by letting A^' be the center of the incircle of DeltaBCI, and similarly defining B^' and ...

A generalization of the Fibonacci numbers defined by the four constants (p,q,r,s) and the definitions H_0=p and H_1=q together with the linear recurrence equation ...

The Fredholm integral equation of the second kind f(x)=1+1/piint_(-1)^1(f(t))/((x-t)^2+1)dt that arises in electrostatics (Love 1949, Fox and Goodwin 1953, and Abbott 2002).

A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...

If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...

An affine tensor is a tensor that corresponds to certain allowable linear coordinate transformations, T:x^_^i=a^i_jx^j, where the determinant of a^i_j is nonzero. This ...

A variable with a beta binomial distribution is distributed as a binomial distribution with parameter p, where p is distribution with a beta distribution with parameters ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...