Search Results for ""

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...

A presentation of a group is a description of a set I and a subset R of the free group F(I) generated by I, written <(x_i)_(i in I)|(r)_(r in R)>, where r=1 (the identity ...

The upper central series of a group G is the sequence of groups (each term normal in the term following it) 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... that is constructed in the ...

A special case of nim played by the following rules. Given a heap of size n, two players alternately select a heap and divide it into two unequal heaps. A player loses when ...

An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...