Search Results for ""

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six.". The first few sexy prime pairs are (5, 11), (7, 13), (11, 17), (13, ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

Consider a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then the Herbrand universe H of S is defined by the following rules. 1. All constants ...

A regular two-dimensional arrangement of squares separated by vertical and horizontal "canals." Looking at the grid produces the illusion of gray spots in the white area ...

The index I associated to a symmetric, non-degenerate, and bilinear g over a finite-dimensional vector space V is a nonnegative integer defined by I=max_(W in S)(dimW) where ...

Shephard's conjecture states that every convex polyhedron admits a self-unoverlapping unfolding (Shephard 1975). This question is still unsettled (Malkevitch), though most ...