Search Results for ""

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ...

The Lebesgue measure is an extension of the classical notions of length and area to more complicated sets. Given an open set S=sum_(k)(a_k,b_k) containing disjoint intervals, ...

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

A fractal curve created from the base curve and motif illustrated above (Lauwerier 1991, p. 37). As illustrated above, the number of segments after the nth iteration is ...

A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...

There are several meanings of "null vector" in mathematics. 1. The most common meaning of null vector is the n-dimensional vector 0 of length 0. i.e., the vector with n ...

The pentakis dodecahedron is the 60-faced dual polyhedron of the truncated icosahedron A_(11) (Holden 1971, p. 55). It is Wenninger dual W_9. It can be constructed by ...