Search Results for ""

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

If a fixed point is added to each group of a special complete series, then the resulting series is complete.

A type of error-correcting code that is related to Hadamard matrices.

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

A reflex angle is an angle of more than 180 degrees. A full angle is therefore a reflex angle, while acute, obtuse, right, and straight angles are not.

An object is reflexible if it is superposable with its image in a plane mirror. Also called amphichiral.

An automorphism which interchanges the two vertices of a regular map at each edge without interchanging the vertices.

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