Search Results for ""

Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...

A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.

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

A Reeb component is a Reeb foliation (M,F) whose leaves are proper. A foliation which has no Reeb components is said to be Reebless.

The Reeb foliation of the hypersphere S^3 is a foliation constructed as the union of two solid tori with common boundary.

A foliation which has no Reeb components is said to be Reebless.

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.

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.