Search Results for ""

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

The 13 Archimedean dual graphs are the skeletons of the Archimedean dual solids, illustrated above. Since they are polyhedral graphs, they are also planar. However, none of ...

A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...