Search Results for ""

A hedgehog is an envelope parameterized by its Gauss map (Martinez-Maure 1996). Viewed another way, a hedgehog is a Minkowski difference of a convex body (Martinez-Maure ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

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 ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

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 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 ...

A square which is magic under multiplication instead of addition (the operation used to define a conventional magic square) is called a multiplication magic square. Unlike ...

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}. ...