Search Results for ""

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

Let p={a_1,a_2,...,a_n} be a permutation. Then i is a permutation ascent if a_i<a_(i+1). For example, the permutation {1,2,3,4} is composed of three ascents, namely {1,2}, ...

The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...

The permutation tensor, also called the Levi-Civita tensor or isotropic tensor of rank 3 (Goldstein 1980, p. 172), is a pseudotensor which is antisymmetric under the ...

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...

Bubbles can meet only at angles of 120 degrees (for three bubbles) and cos^(-1)(-1/3) approx 109 degrees28^'16^('') (for four bubbles), where cos^(-1)(-1/3) is the ...

The Poisson sum formula is a special case of the general result sum_(-infty)^inftyf(x+n)=sum_(k=-infty)^inftye^(2piikx)int_(-infty)^inftyf(x^')e^(-2piikx^')dx^' (1) with x=0, ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...