Search Results for ""

Turmites, also called turning machines, are 2-dimensional Turing machines in which the "tape" consists of a grid of spaces that can be written and erased by an active ...

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

An expression is said to be ambiguous (or poorly defined) if its definition does not assign it a unique interpretation or value. An expression which is not ambiguous is said ...

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...

Let f be a contraction mapping from a closed subset F of a Banach space E into F. Then there exists a unique z in F such that f(z)=z.

If f(x,y) is an analytic function in a neighborhood of the point (x_0,y_0) (i.e., it can be expanded in a series of nonnegative integer powers of (x-x_0) and (y-y_0)), find a ...

The classification of a collection of objects generally means that a list has been constructed with exactly one member from each isomorphism type among the objects, and that ...

Every compact 3-manifold is the connected sum of a unique collection of prime 3-manifolds.

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...