Search Results for ""

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

For any Abelian group G and any natural number n, there is a unique space (up to homotopy type) such that all homotopy groups except for the nth are trivial (including the ...

A measure algebra which has many properties associated with the convolution measure algebra of a group, but no algebraic structure is assumed for the underlying space.

For a group G, consider a subgroup H with elements h_i and an element x of G not in H, then xh_i for i=1, 2, ... constitute the left coset of the subgroup H with respect to x.

Let T be a maximal torus of a group G, then T intersects every conjugacy class of G, i.e., every element g in G is conjugate to a suitable element in T. The theorem is due to ...

Let G be a group and theta n permutation of G. Then theta is an orthomorphism of G if the self-mapping nu of G defined by nu(x)=x^(-1)theta(x) is also an permutation of G.

If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.

Let G be a group and S be a topological G-set. Then a closed subset F of S is called a fundamental domain of G in S if S is the union of conjugates of F, i.e., S= union _(g ...

For n>=3, there exist no additive finite and invariant measures for the group of displacements in R^n.

If a fixed point is added to each group of a special complete series, then the resulting series is complete.