Search Results for ""

There are two definitions of a metacyclic group. 1. A metacyclic group is a group G such that both its commutator subgroup G^' and the quotient group G/G^' are cyclic (Rose ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...

There are two different definitions of the mid-arc points. The mid-arc points M_(AB), M_(AC), and M_(BC) of a triangle DeltaABC as defined by Johnson (1929) are the points on ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

The point on a line segment dividing it into two segments of equal length. The midpoint of a line segment is easy to locate by first constructing a lens using circular arcs, ...

The midsphere, also called the intersphere, reciprocating sphere, or inversion sphere, is a sphere with respect to which the polyhedron vertices of a polyhedron are the ...

The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...