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

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

The slope b of a line obtained using linear least squares fitting is called the regression coefficient.

A function is termed regular iff it is analytic and single-valued throughout a region R.