Search Results for ""

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

The group of classes of finite dimensional central simple algebras over k with respect to a certain equivalence.

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

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

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

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

A reflexive relation.

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...