Search Results for ""

If a map f:G->G^' from a group G to a group G^' satisfies f(ab)=f(b)f(a) for all a,b in G, then f is said to be an antihomomorphism.

Three impossible ways to combine four bars.

A one-sided surface reminiscent of the Möbius strip, attributed to Gourmalin (Bouvier and George 1979, p. 477; Boas 1995). This surface is topologically equivalent to a Klein ...

The four following types of groups, 1. linear groups, 2. orthogonal groups, 3. symplectic groups, and 4. unitary groups, which were studied before more exotic types of groups ...

A set of four, also called a quartet.

One of the four 3-polyaboloes.

A group L is a component of H if L is a quasisimple group which is a subnormal subgroup of H.

A prime factorization algorithm.

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

A set of four, also called a tetrad.