Search Results for ""

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...

Given vectors u and v, the vector direct product, also known as a dyadic, is uv=u tensor v^(T), where tensor is the Kronecker product and v^(T) is the matrix transpose. For ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_s (1) y = sinphisecphi_s (2) for the normal aspect, where lambda is the longitude, lambda_0 is ...

The Gudermannian function is the odd function denoted either gamma(x) or gd(x) which arises in the inverse equations for the Mercator projection. phi(y)=gd(y) expresses the ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The determination of the number of alternating permutations having elements {1,2,...,n}.

A ruled surface M is said to be a binormal developable of a curve y if M can be parameterized by x(u,v)=y(u)+vB^^(u), where B is the binormal vector.

A sequence of circles which closes (such as a Steiner chain or the circles inscribed in the arbelos) is called a chain.