Search Results for ""

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...

A surface (or "space") of section, also called a Poincaré section (Rasband 1990, pp. 7 and 93-94), is a way of presenting a trajectory in n-dimensional phase space in an ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

An operator A^~ such that A^~^2=A^~ or an element of an algebra x such that x^2=x.

An extension ring R subset= S such that every element of S is integral over R.

The group C_2×C_2×C_2 is one of the three Abelian groups of order 8 (the other two groups are non-Abelian). An example is the modulo multiplication group M_(24) (which is the ...

A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...