Search Results for ""

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

Let a be the angle between v and x, b the angle between v and y, and c the angle between v and z. Then the direction cosines are equivalent to the (x,y,z) coordinates of a ...

Two figures are said to be similar when all corresponding angles are equal, and are directly similar when all corresponding angles are equal and described in the same ...

The Dirichlet lambda function lambda(x) is the Dirichlet L-series defined by lambda(x) = sum_(n=0)^(infty)1/((2n+1)^x) (1) = (1-2^(-x))zeta(x), (2) where zeta(x) is the ...

A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...

kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...

A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...

Dirichlet's principle, also known as Thomson's principle, states that there exists a function u that minimizes the functional D[u]=int_Omega|del u|^2dV (called the Dirichlet ...