Search Results for ""

A knot diagram in which none of the crossings are reducible.

A reducible fraction is a fraction p/q such that GCD(p,q)>1, i.e., p/q can be written in reduced form. A fraction that is not reducible is said to be irreducible. For ...

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

The reflexive closure of a binary relation R on a set X is the minimal reflexive relation R^' on X that contains R. Thus aR^'a for every element a of X and aR^'b for distinct ...

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 ...