Search Results for ""

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.

An area-minimizing surface (rectifiable current) bounded by a smooth curve in R^3 is a smooth submanifold with boundary.

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

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.

A Reinhardt domain with center c is a domain D in C^n such that whenever D contains z_0, the domain D also contains the closed polydisk.

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...