Search Results for ""

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

A fraction a/b written in lowest terms, i.e., by dividing numerator and denominator through by their greatest common divisor (a,b). For example, 2/3 is the reduced fraction ...

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

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.