Search Results for ""

The number d(n) of monotone Boolean functions of n variables (equivalent to one more than the number of antichains on the n-set {1,2,...,n}) is called the nth Dedkind number. ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

Einstein summation is a notational convention for simplifying expressions including summations of vectors, matrices, and general tensors. There are essentially three rules of ...

An ellipsoid can be specified parametrically by x = acosusinv (1) y = bsinusinv (2) z = ccosv. (3) The geodesic parameters are then P = sin^2v(b^2cos^2u+a^2sin^2u) (4) Q = ...

The elongated square gyrobicupola nonuniform polyhedron obtained by rotating the bottom third of a small rhombicuboctahedron (Ball and Coxeter 1987, p. 137). It is also ...

Through a point K in the plane of a triangle DeltaABC, draw parallelians through a point as illustrated above. Then there exist four points K for which ...

Euler's series transformation is a transformation that sometimes accelerates the rate of convergence for an alternating series. Given a convergent alternating series with sum ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

Pick any two relatively prime integers h and k, then the circle C(h,k) of radius 1/(2k^2) centered at (h/k,+/-1/(2k^2)) is known as a Ford circle. No matter what and how many ...