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 ...

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 ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Also let R[z]>0 ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

A variable that appears in a calculation only as a placeholder and which disappears completely in the final result. For example, in the integral int_0^xf(x^')dx^', x^' is a ...

The first singular value k_1 of the elliptic integral of the first kind K(k), corresponding to K^'(k_1)=K(k_1), (1) is given by k_1 = 1/(sqrt(2)) (2) k_1^' = 1/(sqrt(2)). (3) ...

Define an emirpimes ("semiprime" spelled backwards) as a semiprime whose (base 10) reversal is a different semiprime. The first such number is 15, because 15 reversed is 51 ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...