Search Results for ""

The associated Stirling numbers of the first kind d_2(n,k)=d(n,k) are defined as the number of permutations of a given number n having exactly k permutation cycles, all of ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The doubly noncentral F-distribution describes the distribution (X/n_1)/(Y/n_2) for two independently distributed noncentral chi-squared variables X:chi_(n_1)^2(lambda_1) and ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

Differential Equations

A solid of revolution is a solid enclosing the surface of revolution obtained by rotating a 1-dimensional curve, line, etc. about an axis. A portion of a solid of revolution ...