Search Results for ""

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.

The equivalence of manifolds under continuous deformation within the embedding space. Knots of opposite chirality have ambient isotopy, but not regular isotopy.

Consider a second-order ordinary differential equation y^('')+P(x)y^'+Q(x)y=0. If P(x) and Q(x) remain finite at x=x_0, then x_0 is called an ordinary point. If either P(x) ...

The partial differential equation u_t+u_x-6uu_x-u_(txx)=0.

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