Search Results for ""

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

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

Sequences of integers generated in the Collatz problem. For example, for a starting number of 7, the sequence is 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, ...

A Hajós group is a group for which all factorizations of the form (say) Z_n=A direct sum B have A or B periodic, where the period is a divisor of n. Hajós groups arose after ...

In the study of non-associative algebra, there are at least two different notions of what the half-Bol identity is. Throughout, let L be an algebraic loop and let x, y, and z ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...