Search Results for ""

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.

The reflexive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same reflexive closure as R. Thus aR^'b for any elements a and b of X, ...

A regular local ring is a local ring R with maximal ideal m so that m can be generated with exactly d elements where d is the Krull dimension of the ring R. Equivalently, R ...

The regulator of a number field K is a positive number associated with K. The regulator of an imaginary quadratic field is 1 and that of a real quadratic, imaginary cubic, or ...

Two links can be continuously deformed into each other iff any diagram of one can be transformed into a diagram of the other by a sequence of Reidemeister moves.

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...

A relational system is a structure R=(S,{P_i:i in I},{f_j:j in J}) consisting of a set S, a collection of relations P_i(i in I) on S, and a collection of functions f_j(j in ...

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

An algorithm for computing an Egyptian fraction.