Search Results for ""

The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...

The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...

The great rhombicuboctahedron (Cundy and Rowlett 1989, p. 106) is the 26-faced Archimedean solid consisting of faces 12{4}+8{6}+6{8}. It is sometimes called the ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...