Search Results for ""

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

The perspective image of an infinite checkerboard. It can be constructed starting from any triangle DeltaOXY, where OX and OY form the near corner of the floor, and XY is the ...

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

A system of curvilinear coordinates in which two sets of coordinate surfaces are obtained by revolving the curves of the elliptic cylindrical coordinates about the y-axis ...

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthonormal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. ...

The term "parameter" is used in a number of ways in mathematics. In general, mathematical functions may have a number of arguments. Arguments that are typically varied when ...

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

The Pauli matrices, also called the Pauli spin matrices, are complex matrices that arise in Pauli's treatment of spin in quantum mechanics. They are defined by sigma_1 = ...

An impossible figure in which a stairway in the shape of a square appears to circulate indefinitely while still possessing normal steps (Penrose and Penrose 1958). The Dutch ...