Search Results for ""

A projection which maps a sphere (or spheroid) onto a plane. Map projections are generally classified into groups according to common properties (cylindrical vs. conical, ...

The five Mathieu groups M_(11), M_(12), M_(22), M_(23), and M_(24) were the first sporadic groups discovered, having been found in 1861 and 1873 by Mathieu. Frobenius showed ...

The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

If perpendiculars A^', B^', and C^' are dropped on any line L from the vertices of a triangle DeltaABC, then the perpendiculars to the opposite sides from their perpendicular ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

A method of numerically integrating ordinary differential equations by using a trial step at the midpoint of an interval to cancel out lower-order error terms. The ...