Search Results for ""

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

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.

A relation R on a set S is reflexive provided that xRx for every x in S.

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

Let X be a normed space and X^(**)=(X^*)^* denote the second dual vector space of X. The canonical map x|->x^^ defined by x^^(f)=f(x),f in X^* gives an isometric linear ...