Search Results for ""

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

Two triangles having the same triangle medians are said to be comedian triangles (Lachlan 1893, p. 63).

A complex translation is a map of the form z|->z+a, where a is a fixed complex number, which corresponds to translation (shifting) of points the complex plane by the complex ...

A complex vector bundle is a vector bundle pi:E->M whose fiber bundle pi^(-1)(x) is a complex vector space. It is not necessarily a complex manifold, even if its base ...

A concho-spiral, also known as a conchospiral, is a space curve with parametric equations r = mu^ua (1) theta = u (2) z = mu^uc, (3) where mu, a, and c are fixed parameters. ...

A subgroup H of an original group G has elements h_i. Let x be a fixed element of the original group G which is not a member of H. Then the transformation xh_ix^(-1), (i=1, ...

The cotangent bundle of a manifold is similar to the tangent bundle, except that it is the set (x,f) where x in M and f is a dual vector in the tangent space to x in M. The ...

A permutation which shifts all elements of a set by a fixed offset, with the elements shifted off the end inserted back at the beginning. For a set with elements a_0, a_1, ...

The difference of a quantity from some fixed value, usually the "correct" or "expected" one.

The term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...