Search Results for ""

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

Hermite-Gauss quadrature, also called Hermite quadrature, is a Gaussian quadrature over the interval (-infty,infty) with weighting function W(x)=e^(-x^2) (Abramowitz and ...

The Higman-Sims group is the sporadic group HS of order |HS| = 44352000 (1) = 2^9·3^2·5^3·7·11. (2) The Higman-Sims group is 2-transitive, and has permutation representations ...

The term isocline derives from the Greek words for "same slope." For a first-order ordinary differential equation y^'=f(t,y) is, a curve with equation f(t,y)=C for some ...

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

Let M_r be an r-rowed minor of the nth order determinant |A| associated with an n×n matrix A=a_(ij) in which the rows i_1, i_2, ..., i_r are represented with columns k_1, ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...