Search Results for ""

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. 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 ...

Miller's rules, originally devised to restrict the number of icosahedron stellations to avoid, for example, the occurrence of models that appear identical but have different ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...

A game which is played by the following rules. Given one or more piles (nim-heaps), players alternate by taking all or some of the counters in a single heap. The player ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...